./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_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 cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:30:35,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:30:35,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:30:35,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:30:35,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:30:35,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:30:35,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:30:35,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:30:35,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:30:35,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:30:35,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:30:35,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:30:35,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:30:35,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:30:35,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:30:35,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:30:35,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:30:35,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:30:35,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:30:35,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:30:35,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:30:35,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:30:35,363 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:30:35,364 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:30:35,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:30:35,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:30:35,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:30:35,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:30:35,365 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:30:35,365 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:30:35,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:30:35,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:30:35,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:30:35,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:30:35,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:30:35,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:30:35,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:30:35,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:30:35,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:30:35,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:30:35,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:30:35,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:30:35,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:30:35,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:30:35,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:30:35,369 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 -> cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 [2024-11-09 07:30:35,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:30:35,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:30:35,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:30:35,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:30:35,652 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:30:35,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-09 07:30:37,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:30:37,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:30:37,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-09 07:30:37,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5cbbe34/db724593f3774b93b1498cf86a7db26a/FLAG83d75c592 [2024-11-09 07:30:37,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5cbbe34/db724593f3774b93b1498cf86a7db26a [2024-11-09 07:30:37,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:30:37,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:30:37,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:30:37,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:30:37,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:30:37,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:37" (1/1) ... [2024-11-09 07:30:37,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f765528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:37, skipping insertion in model container [2024-11-09 07:30:37,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:37" (1/1) ... [2024-11-09 07:30:37,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:30:38,204 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,232 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,236 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,238 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,242 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,264 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,264 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,271 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,271 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,273 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,274 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,276 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,277 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,278 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,281 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:38,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:30:38,303 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 07:30:38,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60e5b782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:38, skipping insertion in model container [2024-11-09 07:30:38,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:30:38,304 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:30:38,306 INFO L158 Benchmark]: Toolchain (without parser) took 817.11ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 98.2MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 07:30:38,307 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 86.9MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:30:38,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 813.85ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 98.2MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 07:30:38,308 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.23ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 86.9MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 813.85ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 98.2MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_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 cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:30:40,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:30:40,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-09 07:30:40,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:30:40,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:30:40,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:30:40,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:30:40,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:30:40,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:30:40,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:30:40,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:30:40,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:30:40,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:30:40,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:30:40,441 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:30:40,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:30:40,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:30:40,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:30:40,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:30:40,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:30:40,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:30:40,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:30:40,447 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:30:40,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:30:40,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:30:40,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:30:40,448 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:30:40,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:30:40,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:30:40,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:30:40,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:30:40,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:30:40,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:30:40,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:30:40,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:30:40,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:30:40,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:30:40,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:30:40,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:30:40,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:30:40,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:30:40,454 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:30:40,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:30:40,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:30:40,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:30:40,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:30:40,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:30:40,455 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 -> cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 [2024-11-09 07:30:40,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:30:40,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:30:40,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:30:40,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:30:40,805 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:30:40,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-09 07:30:42,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:30:42,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:30:42,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-09 07:30:42,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a9ee760/db294ee8ec6c4fe894c6c72bffc540e9/FLAG07729949b [2024-11-09 07:30:42,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a9ee760/db294ee8ec6c4fe894c6c72bffc540e9 [2024-11-09 07:30:42,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:30:42,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:30:42,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:30:42,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:30:42,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:30:42,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:42" (1/1) ... [2024-11-09 07:30:42,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f3c104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:42, skipping insertion in model container [2024-11-09 07:30:42,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:42" (1/1) ... [2024-11-09 07:30:42,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:30:43,537 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,561 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,564 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,576 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,615 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,616 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,622 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,623 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,627 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,630 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,631 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,632 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,633 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,636 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:30:43,651 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:30:43,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:30:43,747 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,755 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,757 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,759 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,766 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,792 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,792 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,794 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,798 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,800 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,803 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,804 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,805 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,805 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,808 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:43,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:30:43,815 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:30:43,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:30:44,012 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:30:44,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44 WrapperNode [2024-11-09 07:30:44,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:30:44,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:30:44,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:30:44,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:30:44,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,170 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3043 [2024-11-09 07:30:44,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:30:44,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:30:44,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:30:44,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:30:44,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,301 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [220, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2024-11-09 07:30:44,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:30:44,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:30:44,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:30:44,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:30:44,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (1/1) ... [2024-11-09 07:30:44,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:30:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:30:44,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:30:44,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:30:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:30:44,534 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:30:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:30:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:30:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 07:30:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:30:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:30:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:30:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:30:44,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:30:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 07:30:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 07:30:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 07:30:44,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 07:30:44,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 07:30:44,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:30:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:30:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:30:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:30:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:30:44,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:30:44,805 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:30:44,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:30:54,467 INFO L? ?]: Removed 638 outVars from TransFormulas that were not future-live. [2024-11-09 07:30:54,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:30:54,512 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:30:54,512 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 07:30:54,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:30:54 BoogieIcfgContainer [2024-11-09 07:30:54,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:30:54,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:30:54,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:30:54,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:30:54,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:30:42" (1/3) ... [2024-11-09 07:30:54,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79eb9ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:54, skipping insertion in model container [2024-11-09 07:30:54,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:44" (2/3) ... [2024-11-09 07:30:54,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79eb9ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:54, skipping insertion in model container [2024-11-09 07:30:54,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:30:54" (3/3) ... [2024-11-09 07:30:54,521 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-2.i [2024-11-09 07:30:54,536 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:30:54,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:30:54,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:30:54,617 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;@5322a349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:30:54,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:30:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 1207 states, 696 states have (on average 1.9022988505747127) internal successors, (1324), 1200 states have internal predecessors, (1324), 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-11-09 07:30:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:30:54,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:54,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:30:54,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1758600992, now seen corresponding path program 1 times [2024-11-09 07:30:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:30:54,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652748135] [2024-11-09 07:30:54,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:54,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:30:54,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:30:54,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:30:54,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 07:30:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:54,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 07:30:54,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:30:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:30:54,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:30:54,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:30:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652748135] [2024-11-09 07:30:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652748135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:54,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:54,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:30:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640856008] [2024-11-09 07:30:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:54,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:30:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:30:54,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:30:54,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:30:54,891 INFO L87 Difference]: Start difference. First operand has 1207 states, 696 states have (on average 1.9022988505747127) internal successors, (1324), 1200 states have internal predecessors, (1324), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:30:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:55,014 INFO L93 Difference]: Finished difference Result 1205 states and 2262 transitions. [2024-11-09 07:30:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:30:55,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:30:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:55,059 INFO L225 Difference]: With dead ends: 1205 [2024-11-09 07:30:55,060 INFO L226 Difference]: Without dead ends: 1203 [2024-11-09 07:30:55,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:30:55,066 INFO L432 NwaCegarLoop]: 2262 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:55,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:30:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2024-11-09 07:30:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2024-11-09 07:30:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 694 states have (on average 1.8040345821325647) internal successors, (1252), 1196 states have internal predecessors, (1252), 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-11-09 07:30:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2260 transitions. [2024-11-09 07:30:55,440 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2260 transitions. Word has length 11 [2024-11-09 07:30:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:55,441 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 2260 transitions. [2024-11-09 07:30:55,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:30:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2260 transitions. [2024-11-09 07:30:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:30:55,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:55,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:30:55,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:30:55,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:30:55,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:55,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash 527959264, now seen corresponding path program 1 times [2024-11-09 07:30:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:30:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612204414] [2024-11-09 07:30:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:55,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:30:55,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:30:55,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:30:55,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:30:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:55,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:30:55,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:30:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:30:55,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:30:55,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:30:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612204414] [2024-11-09 07:30:55,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612204414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:55,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:55,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:30:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108827192] [2024-11-09 07:30:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:55,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:30:55,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:30:55,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:30:55,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:30:55,925 INFO L87 Difference]: Start difference. First operand 1203 states and 2260 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:30:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:56,800 INFO L93 Difference]: Finished difference Result 2325 states and 4418 transitions. [2024-11-09 07:30:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:30:56,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:30:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:56,815 INFO L225 Difference]: With dead ends: 2325 [2024-11-09 07:30:56,816 INFO L226 Difference]: Without dead ends: 2325 [2024-11-09 07:30:56,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:30:56,817 INFO L432 NwaCegarLoop]: 2248 mSDtfsCounter, 1148 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:56,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 4482 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:30:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2024-11-09 07:30:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2293. [2024-11-09 07:30:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 1284 states have (on average 1.8450155763239875) internal successors, (2369), 2286 states have internal predecessors, (2369), 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-11-09 07:30:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 4377 transitions. [2024-11-09 07:30:57,085 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 4377 transitions. Word has length 13 [2024-11-09 07:30:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:57,085 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 4377 transitions. [2024-11-09 07:30:57,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:30:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 4377 transitions. [2024-11-09 07:30:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:30:57,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:57,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:30:57,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 07:30:57,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:30:57,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:57,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash 529806306, now seen corresponding path program 1 times [2024-11-09 07:30:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:30:57,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001294427] [2024-11-09 07:30:57,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:57,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:30:57,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:30:57,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:30:57,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 07:30:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:57,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:30:57,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:30:57,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:30:57,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:30:57,523 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 33 treesize of output 31 [2024-11-09 07:30:57,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:30:57,582 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 62 treesize of output 22 [2024-11-09 07:30:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:30:57,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:30:57,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:30:57,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001294427] [2024-11-09 07:30:57,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001294427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:57,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:57,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:30:57,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646703620] [2024-11-09 07:30:57,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:57,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:30:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:30:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:30:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:30:57,620 INFO L87 Difference]: Start difference. First operand 2293 states and 4377 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:31:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:00,682 INFO L93 Difference]: Finished difference Result 4442 states and 8571 transitions. [2024-11-09 07:31:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:31:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:31:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:00,707 INFO L225 Difference]: With dead ends: 4442 [2024-11-09 07:31:00,708 INFO L226 Difference]: Without dead ends: 4442 [2024-11-09 07:31:00,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:31:00,711 INFO L432 NwaCegarLoop]: 2495 mSDtfsCounter, 1231 mSDsluCounter, 4228 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 6723 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:00,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 6723 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 07:31:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2024-11-09 07:31:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 2292. [2024-11-09 07:31:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2292 states, 1283 states have (on average 1.8448947778643803) internal successors, (2367), 2285 states have internal predecessors, (2367), 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-11-09 07:31:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 4375 transitions. [2024-11-09 07:31:01,194 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 4375 transitions. Word has length 13 [2024-11-09 07:31:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:01,194 INFO L471 AbstractCegarLoop]: Abstraction has 2292 states and 4375 transitions. [2024-11-09 07:31:01,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:31:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 4375 transitions. [2024-11-09 07:31:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 07:31:01,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:01,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:01,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:31:01,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:01,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:01,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1685351505, now seen corresponding path program 1 times [2024-11-09 07:31:01,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360963542] [2024-11-09 07:31:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:01,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:01,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:01,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:31:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:01,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:31:01,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:01,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:31:01,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:01,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360963542] [2024-11-09 07:31:01,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360963542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:31:01,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:31:01,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:31:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381625781] [2024-11-09 07:31:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:31:01,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:31:01,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:31:01,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:31:01,954 INFO L87 Difference]: Start difference. First operand 2292 states and 4375 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-09 07:31:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:02,135 INFO L93 Difference]: Finished difference Result 2298 states and 4365 transitions. [2024-11-09 07:31:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:31:02,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 84 [2024-11-09 07:31:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:02,149 INFO L225 Difference]: With dead ends: 2298 [2024-11-09 07:31:02,149 INFO L226 Difference]: Without dead ends: 2298 [2024-11-09 07:31:02,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:31:02,150 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 30 mSDsluCounter, 4441 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6671 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:02,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6671 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:31:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-09 07:31:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2298. [2024-11-09 07:31:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2298 states, 1289 states have (on average 1.8285492629945694) internal successors, (2357), 2291 states have internal predecessors, (2357), 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-11-09 07:31:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 4365 transitions. [2024-11-09 07:31:02,400 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 4365 transitions. Word has length 84 [2024-11-09 07:31:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:02,400 INFO L471 AbstractCegarLoop]: Abstraction has 2298 states and 4365 transitions. [2024-11-09 07:31:02,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-09 07:31:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 4365 transitions. [2024-11-09 07:31:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 07:31:02,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:02,403 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:02,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 07:31:02,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:02,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:02,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1702162501, now seen corresponding path program 1 times [2024-11-09 07:31:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:02,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105797259] [2024-11-09 07:31:02,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:02,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:02,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:02,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:02,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:31:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:03,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:31:03,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:31:03,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:31:03,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:03,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105797259] [2024-11-09 07:31:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105797259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:31:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:31:03,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:31:03,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139239545] [2024-11-09 07:31:03,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:31:03,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:31:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:03,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:31:03,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:31:03,094 INFO L87 Difference]: Start difference. First operand 2298 states and 4365 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-09 07:31:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:03,183 INFO L93 Difference]: Finished difference Result 2301 states and 4369 transitions. [2024-11-09 07:31:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:31:03,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 84 [2024-11-09 07:31:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:03,196 INFO L225 Difference]: With dead ends: 2301 [2024-11-09 07:31:03,196 INFO L226 Difference]: Without dead ends: 2301 [2024-11-09 07:31:03,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:31:03,197 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 0 mSDsluCounter, 4488 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6734 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:03,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6734 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:31:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2024-11-09 07:31:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2301. [2024-11-09 07:31:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 1291 states have (on average 1.8280402788536019) internal successors, (2360), 2294 states have internal predecessors, (2360), 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-11-09 07:31:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 4369 transitions. [2024-11-09 07:31:03,623 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 4369 transitions. Word has length 84 [2024-11-09 07:31:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:03,624 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 4369 transitions. [2024-11-09 07:31:03,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-09 07:31:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 4369 transitions. [2024-11-09 07:31:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 07:31:03,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:03,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:03,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:31:03,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:03,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:03,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2014403001, now seen corresponding path program 1 times [2024-11-09 07:31:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:03,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378634404] [2024-11-09 07:31:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:03,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:03,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:03,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:03,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 07:31:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:04,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:31:04,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:31:04,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:31:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:31:04,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:04,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378634404] [2024-11-09 07:31:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378634404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:31:04,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:31:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 07:31:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436783116] [2024-11-09 07:31:04,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:31:04,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:31:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:04,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:31:04,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:31:04,474 INFO L87 Difference]: Start difference. First operand 2301 states and 4369 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-11-09 07:31:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:04,696 INFO L93 Difference]: Finished difference Result 2312 states and 4385 transitions. [2024-11-09 07:31:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:31:04,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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 86 [2024-11-09 07:31:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:04,709 INFO L225 Difference]: With dead ends: 2312 [2024-11-09 07:31:04,710 INFO L226 Difference]: Without dead ends: 2312 [2024-11-09 07:31:04,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:31:04,711 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 4 mSDsluCounter, 11214 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13460 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:04,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13460 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:31:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2024-11-09 07:31:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2310. [2024-11-09 07:31:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 1299 states have (on average 1.8275596612779061) internal successors, (2374), 2302 states have internal predecessors, (2374), 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-11-09 07:31:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4383 transitions. [2024-11-09 07:31:05,003 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4383 transitions. Word has length 86 [2024-11-09 07:31:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:05,004 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 4383 transitions. [2024-11-09 07:31:05,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-11-09 07:31:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4383 transitions. [2024-11-09 07:31:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 07:31:05,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:05,007 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:05,019 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:31:05,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:05,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:05,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1271967579, now seen corresponding path program 2 times [2024-11-09 07:31:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756138847] [2024-11-09 07:31:05,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:31:05,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:05,213 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:05,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:31:05,507 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:31:05,507 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:31:05,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:31:05,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 07:31:05,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:31:05,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:05,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756138847] [2024-11-09 07:31:05,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756138847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:31:05,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:31:05,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:31:05,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791436142] [2024-11-09 07:31:05,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:31:05,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:31:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:31:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:31:05,582 INFO L87 Difference]: Start difference. First operand 2310 states and 4383 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-09 07:31:09,972 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-11-09 07:31:11,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:31:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:16,397 INFO L93 Difference]: Finished difference Result 3443 states and 6558 transitions. [2024-11-09 07:31:16,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:31:16,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 90 [2024-11-09 07:31:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:16,416 INFO L225 Difference]: With dead ends: 3443 [2024-11-09 07:31:16,417 INFO L226 Difference]: Without dead ends: 3443 [2024-11-09 07:31:16,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:31:16,419 INFO L432 NwaCegarLoop]: 2316 mSDtfsCounter, 3545 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 896 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4048 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 896 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:16,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4048 Valid, 4530 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [896 Valid, 615 Invalid, 1 Unknown, 0 Unchecked, 10.7s Time] [2024-11-09 07:31:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2024-11-09 07:31:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3418. [2024-11-09 07:31:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3418 states, 1906 states have (on average 1.8426023084994754) internal successors, (3512), 3409 states have internal predecessors, (3512), 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-11-09 07:31:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 6524 transitions. [2024-11-09 07:31:16,778 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 6524 transitions. Word has length 90 [2024-11-09 07:31:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:16,780 INFO L471 AbstractCegarLoop]: Abstraction has 3418 states and 6524 transitions. [2024-11-09 07:31:16,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-09 07:31:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 6524 transitions. [2024-11-09 07:31:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 07:31:16,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:16,784 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:16,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 07:31:16,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:16,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:16,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -558294041, now seen corresponding path program 1 times [2024-11-09 07:31:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:16,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515072412] [2024-11-09 07:31:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:16,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:16,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:16,989 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:16,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:31:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:17,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:31:17,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:17,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:31:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:31:17,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:17,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515072412] [2024-11-09 07:31:17,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515072412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:31:17,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:31:17,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 07:31:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040814076] [2024-11-09 07:31:17,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:31:17,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:31:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:31:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:31:17,903 INFO L87 Difference]: Start difference. First operand 3418 states and 6524 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 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-11-09 07:31:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:18,630 INFO L93 Difference]: Finished difference Result 3433 states and 6547 transitions. [2024-11-09 07:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:31:18,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 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 100 [2024-11-09 07:31:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:18,668 INFO L225 Difference]: With dead ends: 3433 [2024-11-09 07:31:18,672 INFO L226 Difference]: Without dead ends: 3429 [2024-11-09 07:31:18,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:31:18,673 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 8 mSDsluCounter, 11223 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 13469 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:18,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 13469 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:31:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2024-11-09 07:31:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3427. [2024-11-09 07:31:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 1915 states have (on average 1.8402088772845953) internal successors, (3524), 3418 states have internal predecessors, (3524), 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-11-09 07:31:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 6536 transitions. [2024-11-09 07:31:19,035 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 6536 transitions. Word has length 100 [2024-11-09 07:31:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:19,036 INFO L471 AbstractCegarLoop]: Abstraction has 3427 states and 6536 transitions. [2024-11-09 07:31:19,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 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-11-09 07:31:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 6536 transitions. [2024-11-09 07:31:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 07:31:19,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:19,037 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:19,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 07:31:19,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:19,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:19,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1727149690, now seen corresponding path program 2 times [2024-11-09 07:31:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:19,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607307111] [2024-11-09 07:31:19,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:31:19,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:19,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:19,243 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:19,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 07:31:19,582 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:31:19,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:31:19,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:31:19,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:19,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:31:19,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:31:19,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:31:19,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 07:31:19,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:31:19,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 07:31:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-09 07:31:19,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:31:19,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:19,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607307111] [2024-11-09 07:31:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607307111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:31:19,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:31:19,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:31:19,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922233921] [2024-11-09 07:31:19,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:31:19,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:31:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:19,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:31:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:31:19,709 INFO L87 Difference]: Start difference. First operand 3427 states and 6536 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-11-09 07:31:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:22,201 INFO L93 Difference]: Finished difference Result 6608 states and 12771 transitions. [2024-11-09 07:31:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:31:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 109 [2024-11-09 07:31:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:22,226 INFO L225 Difference]: With dead ends: 6608 [2024-11-09 07:31:22,227 INFO L226 Difference]: Without dead ends: 6608 [2024-11-09 07:31:22,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:31:22,227 INFO L432 NwaCegarLoop]: 2626 mSDtfsCounter, 1177 mSDsluCounter, 4348 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 6974 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:22,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 6974 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 07:31:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2024-11-09 07:31:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 3431. [2024-11-09 07:31:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3431 states, 1919 states have (on average 1.8384575299635226) internal successors, (3528), 3422 states have internal predecessors, (3528), 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-11-09 07:31:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 6540 transitions. [2024-11-09 07:31:22,990 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 6540 transitions. Word has length 109 [2024-11-09 07:31:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:22,991 INFO L471 AbstractCegarLoop]: Abstraction has 3431 states and 6540 transitions. [2024-11-09 07:31:22,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-11-09 07:31:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 6540 transitions. [2024-11-09 07:31:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 07:31:22,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:22,995 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:23,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 07:31:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:23,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1354044540, now seen corresponding path program 1 times [2024-11-09 07:31:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:23,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285125953] [2024-11-09 07:31:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:23,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:23,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:23,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:23,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 07:31:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:23,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:31:23,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:31:23,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:31:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:31:24,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:24,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285125953] [2024-11-09 07:31:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285125953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:31:24,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:31:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 07:31:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083854569] [2024-11-09 07:31:24,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:31:24,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:31:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:24,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:31:24,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:31:24,620 INFO L87 Difference]: Start difference. First operand 3431 states and 6540 transitions. Second operand has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:31:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:26,653 INFO L93 Difference]: Finished difference Result 3455 states and 6581 transitions. [2024-11-09 07:31:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 07:31:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 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 142 [2024-11-09 07:31:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:26,668 INFO L225 Difference]: With dead ends: 3455 [2024-11-09 07:31:26,668 INFO L226 Difference]: Without dead ends: 3451 [2024-11-09 07:31:26,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:31:26,670 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 14 mSDsluCounter, 26929 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29175 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:26,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29175 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:31:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2024-11-09 07:31:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3449. [2024-11-09 07:31:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 1937 states have (on average 1.8337635518843574) internal successors, (3552), 3440 states have internal predecessors, (3552), 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-11-09 07:31:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 6564 transitions. [2024-11-09 07:31:27,013 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 6564 transitions. Word has length 142 [2024-11-09 07:31:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:27,013 INFO L471 AbstractCegarLoop]: Abstraction has 3449 states and 6564 transitions. [2024-11-09 07:31:27,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:31:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 6564 transitions. [2024-11-09 07:31:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 07:31:27,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:27,015 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:27,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 07:31:27,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:27,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:27,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -357991836, now seen corresponding path program 2 times [2024-11-09 07:31:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:27,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413315463] [2024-11-09 07:31:27,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:31:27,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:27,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:27,218 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:27,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 07:31:27,544 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:31:27,544 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:31:27,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:31:27,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-09 07:31:27,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:31:27,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413315463] [2024-11-09 07:31:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413315463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:31:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:31:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:31:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734442746] [2024-11-09 07:31:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:31:27,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:31:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:31:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:31:27,575 INFO L87 Difference]: Start difference. First operand 3449 states and 6564 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:31:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:27,671 INFO L93 Difference]: Finished difference Result 3509 states and 6624 transitions. [2024-11-09 07:31:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:31:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 160 [2024-11-09 07:31:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:27,683 INFO L225 Difference]: With dead ends: 3509 [2024-11-09 07:31:27,683 INFO L226 Difference]: Without dead ends: 3509 [2024-11-09 07:31:27,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:31:27,685 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 5 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:27,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4443 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:31:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2024-11-09 07:31:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3509. [2024-11-09 07:31:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 1997 states have (on average 1.8087130696044067) internal successors, (3612), 3500 states have internal predecessors, (3612), 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-11-09 07:31:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 6624 transitions. [2024-11-09 07:31:28,063 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 6624 transitions. Word has length 160 [2024-11-09 07:31:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:28,064 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 6624 transitions. [2024-11-09 07:31:28,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:31:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 6624 transitions. [2024-11-09 07:31:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 07:31:28,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:28,066 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:28,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 07:31:28,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:28,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:28,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash 805380968, now seen corresponding path program 1 times [2024-11-09 07:31:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564328042] [2024-11-09 07:31:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:28,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:28,269 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:28,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 07:31:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:28,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:31:28,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 07:31:29,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:31:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 07:31:31,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:31,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564328042] [2024-11-09 07:31:31,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564328042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:31:31,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:31:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 07:31:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214504813] [2024-11-09 07:31:31,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:31:31,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 07:31:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 07:31:31,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:31:31,917 INFO L87 Difference]: Start difference. First operand 3509 states and 6624 transitions. Second operand has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:31:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:40,365 INFO L93 Difference]: Finished difference Result 3549 states and 6697 transitions. [2024-11-09 07:31:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 07:31:40,366 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 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 160 [2024-11-09 07:31:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:40,377 INFO L225 Difference]: With dead ends: 3549 [2024-11-09 07:31:40,377 INFO L226 Difference]: Without dead ends: 3545 [2024-11-09 07:31:40,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 07:31:40,381 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 25 mSDsluCounter, 56097 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58343 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:40,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 58343 Invalid, 1967 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 07:31:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2024-11-09 07:31:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3543. [2024-11-09 07:31:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 2031 states have (on average 1.8010832102412604) internal successors, (3658), 3534 states have internal predecessors, (3658), 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-11-09 07:31:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 6670 transitions. [2024-11-09 07:31:40,829 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 6670 transitions. Word has length 160 [2024-11-09 07:31:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:40,830 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 6670 transitions. [2024-11-09 07:31:40,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:31:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 6670 transitions. [2024-11-09 07:31:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-09 07:31:40,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:40,832 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:40,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 07:31:41,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:41,033 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash -629013880, now seen corresponding path program 2 times [2024-11-09 07:31:41,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:41,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704350908] [2024-11-09 07:31:41,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:31:41,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:41,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:41,035 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:41,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 07:31:41,466 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:31:41,466 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:31:41,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:31:41,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2351 trivial. 0 not checked. [2024-11-09 07:31:41,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:31:41,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704350908] [2024-11-09 07:31:41,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704350908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:31:41,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:31:41,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:31:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408462936] [2024-11-09 07:31:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:31:41,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:31:41,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:31:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:31:41,508 INFO L87 Difference]: Start difference. First operand 3543 states and 6670 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:31:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:41,634 INFO L93 Difference]: Finished difference Result 3492 states and 6586 transitions. [2024-11-09 07:31:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:31:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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 194 [2024-11-09 07:31:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:41,645 INFO L225 Difference]: With dead ends: 3492 [2024-11-09 07:31:41,646 INFO L226 Difference]: Without dead ends: 3492 [2024-11-09 07:31:41,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:31:41,646 INFO L432 NwaCegarLoop]: 2216 mSDtfsCounter, 32 mSDsluCounter, 4418 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6634 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:41,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6634 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:31:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2024-11-09 07:31:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3492. [2024-11-09 07:31:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3492 states, 1980 states have (on average 1.805050505050505) internal successors, (3574), 3483 states have internal predecessors, (3574), 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-11-09 07:31:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 6586 transitions. [2024-11-09 07:31:42,084 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 6586 transitions. Word has length 194 [2024-11-09 07:31:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:42,085 INFO L471 AbstractCegarLoop]: Abstraction has 3492 states and 6586 transitions. [2024-11-09 07:31:42,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:31:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 6586 transitions. [2024-11-09 07:31:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-09 07:31:42,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:42,087 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:42,093 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-11-09 07:31:42,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:42,289 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:42,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1394922298, now seen corresponding path program 1 times [2024-11-09 07:31:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071603905] [2024-11-09 07:31:42,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:42,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:42,295 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:42,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 07:31:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:43,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:31:43,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:31:44,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:31:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:31:46,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:31:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071603905] [2024-11-09 07:31:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071603905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:31:46,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:31:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-09 07:31:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539483833] [2024-11-09 07:31:46,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:31:46,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:31:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:31:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:31:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:31:46,531 INFO L87 Difference]: Start difference. First operand 3492 states and 6586 transitions. Second operand has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:31:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:53,260 INFO L93 Difference]: Finished difference Result 3521 states and 6642 transitions. [2024-11-09 07:31:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-09 07:31:53,261 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 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 194 [2024-11-09 07:31:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:53,273 INFO L225 Difference]: With dead ends: 3521 [2024-11-09 07:31:53,274 INFO L226 Difference]: Without dead ends: 3521 [2024-11-09 07:31:53,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-09 07:31:53,277 INFO L432 NwaCegarLoop]: 2234 mSDtfsCounter, 27 mSDsluCounter, 55802 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58036 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:53,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 58036 Invalid, 1432 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 07:31:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2024-11-09 07:31:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 3517. [2024-11-09 07:31:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 2005 states have (on average 1.8074812967581046) internal successors, (3624), 3508 states have internal predecessors, (3624), 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-11-09 07:31:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 6636 transitions. [2024-11-09 07:31:53,675 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 6636 transitions. Word has length 194 [2024-11-09 07:31:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:53,675 INFO L471 AbstractCegarLoop]: Abstraction has 3517 states and 6636 transitions. [2024-11-09 07:31:53,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:31:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 6636 transitions. [2024-11-09 07:31:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-09 07:31:53,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:53,678 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:53,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 07:31:53,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:53,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:53,883 INFO L85 PathProgramCache]: Analyzing trace with hash -705410483, now seen corresponding path program 2 times [2024-11-09 07:31:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:31:53,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077241136] [2024-11-09 07:31:53,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:31:53,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:31:53,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:31:53,887 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:31:53,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 07:31:55,608 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:31:55,608 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:31:55,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:31:55,653 INFO L278 TraceCheckSpWp]: Computing forward predicates...