./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:42:56,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:42:56,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:42:56,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:42:56,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:42:56,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:42:56,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:42:56,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:42:56,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:42:56,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:42:56,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:42:56,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:42:56,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:42:56,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:42:56,455 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:42:56,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:42:56,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:42:56,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:42:56,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:42:56,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:42:56,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:42:56,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:42:56,462 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:42:56,462 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:42:56,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:42:56,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:42:56,463 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:42:56,463 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:42:56,463 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:42:56,463 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:42:56,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:42:56,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:42:56,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:42:56,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:42:56,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:42:56,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:42:56,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:42:56,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:42:56,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:42:56,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:42:56,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:42:56,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:42:56,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:42:56,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:42:56,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:42:56,470 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-clean/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-clean/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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2024-10-11 17:42:56,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:42:56,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:42:56,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:42:56,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:42:56,769 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:42:56,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-10-11 17:42:58,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:42:58,555 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:42:58,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-10-11 17:42:58,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4cbca2e8c/9d058bd45d30434aaf3d9e2932569ebc/FLAG6e22ae4a8 [2024-10-11 17:42:58,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4cbca2e8c/9d058bd45d30434aaf3d9e2932569ebc [2024-10-11 17:42:58,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:42:58,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:42:58,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:42:58,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:42:58,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:42:58,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:42:58" (1/1) ... [2024-10-11 17:42:58,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e595088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:42:58, skipping insertion in model container [2024-10-11 17:42:58,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:42:58" (1/1) ... [2024-10-11 17:42:58,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:42:59,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:42:59,362 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 17:42:59,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@220d5d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:42:59, skipping insertion in model container [2024-10-11 17:42:59,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:42:59,367 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:42:59,369 INFO L158 Benchmark]: Toolchain (without parser) took 760.96ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 72.8MB in the beginning and 165.7MB in the end (delta: -92.9MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-10-11 17:42:59,370 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 146.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:42:59,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 758.14ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 72.6MB in the beginning and 165.7MB in the end (delta: -93.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-10-11 17:42:59,372 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.13ms. Allocated memory is still 146.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 758.14ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 72.6MB in the beginning and 165.7MB in the end (delta: -93.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:43:01,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:43:01,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:43:01,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:43:01,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:43:01,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:43:01,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:43:01,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:43:01,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:43:01,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:43:01,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:43:01,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:43:01,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:43:01,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:43:01,556 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:43:01,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:43:01,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:43:01,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:43:01,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:43:01,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:43:01,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:43:01,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:43:01,558 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:43:01,559 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:43:01,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:43:01,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:43:01,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:43:01,559 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:43:01,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:43:01,560 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:43:01,560 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:43:01,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:43:01,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:43:01,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:43:01,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:43:01,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:43:01,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:43:01,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:43:01,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:43:01,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:43:01,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:43:01,565 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:43:01,565 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:43:01,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:43:01,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:43:01,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:43:01,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:43:01,566 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:43:01,566 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-clean/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-clean/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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2024-10-11 17:43:01,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:43:01,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:43:01,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:43:01,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:43:01,928 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:43:01,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-10-11 17:43:03,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:43:03,796 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:43:03,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-10-11 17:43:03,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba6360ada/bf82f86f08b74be2bf002b343e91d593/FLAGb4375fdd5 [2024-10-11 17:43:04,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba6360ada/bf82f86f08b74be2bf002b343e91d593 [2024-10-11 17:43:04,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:43:04,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:43:04,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:43:04,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:43:04,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:43:04,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:43:04" (1/1) ... [2024-10-11 17:43:04,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c8694f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:04, skipping insertion in model container [2024-10-11 17:43:04,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:43:04" (1/1) ... [2024-10-11 17:43:04,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:43:04,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:43:04,897 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:43:04,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:43:05,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:43:05,029 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:43:05,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:43:05,191 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:43:05,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05 WrapperNode [2024-10-11 17:43:05,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:43:05,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:43:05,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:43:05,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:43:05,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,310 INFO L138 Inliner]: procedures = 285, calls = 343, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1224 [2024-10-11 17:43:05,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:43:05,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:43:05,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:43:05,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:43:05,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,466 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 34, 3, 270]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 4, 2, 57]. [2024-10-11 17:43:05,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:43:05,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:43:05,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:43:05,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:43:05,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (1/1) ... [2024-10-11 17:43:05,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:43:05,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:43:05,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:43:05,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:43:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 17:43:05,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 17:43:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:43:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:43:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:43:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 17:43:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:43:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:43:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 17:43:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 17:43:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:43:05,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:43:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-11 17:43:05,644 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:43:05,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-11 17:43:05,644 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:43:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:43:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:43:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 17:43:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-11 17:43:05,645 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-11 17:43:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:43:05,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:43:05,895 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:43:05,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:43:13,144 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-10-11 17:43:13,145 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:43:13,201 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:43:13,202 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-11 17:43:13,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:43:13 BoogieIcfgContainer [2024-10-11 17:43:13,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:43:13,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:43:13,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:43:13,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:43:13,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:43:04" (1/3) ... [2024-10-11 17:43:13,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea61a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:43:13, skipping insertion in model container [2024-10-11 17:43:13,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:43:05" (2/3) ... [2024-10-11 17:43:13,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea61a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:43:13, skipping insertion in model container [2024-10-11 17:43:13,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:43:13" (3/3) ... [2024-10-11 17:43:13,210 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-2.i [2024-10-11 17:43:13,224 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:43:13,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:43:13,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:43:13,269 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;@4c8acab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:43:13,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:43:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 232 states have (on average 1.6336206896551724) internal successors, (379), 237 states have internal predecessors, (379), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 17:43:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:43:13,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:13,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:43:13,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:13,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash -711634754, now seen corresponding path program 1 times [2024-10-11 17:43:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:13,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123391087] [2024-10-11 17:43:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:13,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:13,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:13,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:13,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 17:43:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:13,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:43:13,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:13,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:43:13,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123391087] [2024-10-11 17:43:13,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123391087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:43:13,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:43:13,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:43:13,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020668902] [2024-10-11 17:43:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:43:13,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:43:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:13,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:43:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:43:13,566 INFO L87 Difference]: Start difference. First operand has 259 states, 232 states have (on average 1.6336206896551724) internal successors, (379), 237 states have internal predecessors, (379), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:43:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:13,646 INFO L93 Difference]: Finished difference Result 254 states and 332 transitions. [2024-10-11 17:43:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:43:13,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2024-10-11 17:43:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:13,660 INFO L225 Difference]: With dead ends: 254 [2024-10-11 17:43:13,661 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 17:43:13,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:43:13,665 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:13,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:43:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 17:43:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-11 17:43:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 228 states have (on average 1.3026315789473684) internal successors, (297), 233 states have internal predecessors, (297), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 17:43:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 331 transitions. [2024-10-11 17:43:13,760 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 331 transitions. Word has length 9 [2024-10-11 17:43:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:13,764 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 331 transitions. [2024-10-11 17:43:13,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:43:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 331 transitions. [2024-10-11 17:43:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:43:13,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:13,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:43:13,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 17:43:13,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:13,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:13,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1093340257, now seen corresponding path program 1 times [2024-10-11 17:43:13,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:13,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527950996] [2024-10-11 17:43:13,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:13,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:13,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:13,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:13,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 17:43:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:14,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:43:14,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:14,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:43:14,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527950996] [2024-10-11 17:43:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527950996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:43:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:43:14,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:43:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571905471] [2024-10-11 17:43:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:43:14,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:43:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:43:14,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:43:14,261 INFO L87 Difference]: Start difference. First operand 253 states and 331 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-10-11 17:43:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:18,010 INFO L93 Difference]: Finished difference Result 406 states and 533 transitions. [2024-10-11 17:43:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:43:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-10-11 17:43:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:18,014 INFO L225 Difference]: With dead ends: 406 [2024-10-11 17:43:18,014 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 17:43:18,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:43:18,019 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 183 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:18,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 919 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 17:43:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 17:43:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 370. [2024-10-11 17:43:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 342 states have (on average 1.304093567251462) internal successors, (446), 347 states have internal predecessors, (446), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 17:43:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 486 transitions. [2024-10-11 17:43:18,044 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 486 transitions. Word has length 11 [2024-10-11 17:43:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:18,044 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 486 transitions. [2024-10-11 17:43:18,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-10-11 17:43:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 486 transitions. [2024-10-11 17:43:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:43:18,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:18,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:43:18,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 17:43:18,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:18,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:18,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2126280651, now seen corresponding path program 1 times [2024-10-11 17:43:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:18,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544313393] [2024-10-11 17:43:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:18,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:18,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:18,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:18,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 17:43:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:18,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:43:18,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:18,472 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:43:18,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:43:18,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:43:18,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-11 17:43:18,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:43:18,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-11 17:43:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:18,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:43:18,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:18,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544313393] [2024-10-11 17:43:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544313393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:43:18,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:43:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:43:18,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143505931] [2024-10-11 17:43:18,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:43:18,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:43:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:43:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:43:18,560 INFO L87 Difference]: Start difference. First operand 370 states and 486 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:43:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:19,070 INFO L93 Difference]: Finished difference Result 581 states and 770 transitions. [2024-10-11 17:43:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:43:19,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:43:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:19,073 INFO L225 Difference]: With dead ends: 581 [2024-10-11 17:43:19,073 INFO L226 Difference]: Without dead ends: 581 [2024-10-11 17:43:19,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:43:19,074 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 270 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:19,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1011 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:43:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-11 17:43:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 369. [2024-10-11 17:43:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 341 states have (on average 1.3020527859237536) internal successors, (444), 346 states have internal predecessors, (444), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 17:43:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 484 transitions. [2024-10-11 17:43:19,091 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 484 transitions. Word has length 14 [2024-10-11 17:43:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:19,092 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 484 transitions. [2024-10-11 17:43:19,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:43:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 484 transitions. [2024-10-11 17:43:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:43:19,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:19,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:43:19,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 17:43:19,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:19,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:19,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash -130810140, now seen corresponding path program 1 times [2024-10-11 17:43:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:19,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380653342] [2024-10-11 17:43:19,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:19,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:19,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:19,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:19,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 17:43:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:19,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:43:19,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:19,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:43:19,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:19,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380653342] [2024-10-11 17:43:19,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380653342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:43:19,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:43:19,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:43:19,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250664826] [2024-10-11 17:43:19,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:43:19,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:43:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:19,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:43:19,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:43:19,598 INFO L87 Difference]: Start difference. First operand 369 states and 484 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:43:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:19,744 INFO L93 Difference]: Finished difference Result 375 states and 474 transitions. [2024-10-11 17:43:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:43:19,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 17:43:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:19,746 INFO L225 Difference]: With dead ends: 375 [2024-10-11 17:43:19,746 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 17:43:19,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:43:19,747 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 30 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:19,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 862 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:43:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 17:43:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-11 17:43:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 347 states have (on average 1.2507204610951008) internal successors, (434), 352 states have internal predecessors, (434), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 17:43:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 474 transitions. [2024-10-11 17:43:19,770 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 474 transitions. Word has length 48 [2024-10-11 17:43:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:19,770 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 474 transitions. [2024-10-11 17:43:19,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:43:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 474 transitions. [2024-10-11 17:43:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:43:19,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:19,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:43:19,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:43:19,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:19,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:19,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash 323773912, now seen corresponding path program 1 times [2024-10-11 17:43:19,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:19,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127517415] [2024-10-11 17:43:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:19,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:19,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:19,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:19,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 17:43:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:20,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:43:20,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:20,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:43:20,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127517415] [2024-10-11 17:43:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127517415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:43:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:43:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:43:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065355738] [2024-10-11 17:43:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:43:20,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:43:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:43:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:43:20,292 INFO L87 Difference]: Start difference. First operand 375 states and 474 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:43:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:20,467 INFO L93 Difference]: Finished difference Result 384 states and 483 transitions. [2024-10-11 17:43:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:43:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 17:43:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:20,470 INFO L225 Difference]: With dead ends: 384 [2024-10-11 17:43:20,470 INFO L226 Difference]: Without dead ends: 384 [2024-10-11 17:43:20,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:43:20,471 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 8 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:20,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1530 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:43:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-11 17:43:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-10-11 17:43:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 353 states have (on average 1.2492917847025495) internal successors, (441), 359 states have internal predecessors, (441), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 17:43:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 483 transitions. [2024-10-11 17:43:20,481 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 483 transitions. Word has length 48 [2024-10-11 17:43:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:20,482 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 483 transitions. [2024-10-11 17:43:20,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:43:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 483 transitions. [2024-10-11 17:43:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 17:43:20,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:20,484 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:43:20,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 17:43:20,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:20,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:20,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash -441157344, now seen corresponding path program 1 times [2024-10-11 17:43:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:20,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368313616] [2024-10-11 17:43:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:20,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:20,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:20,692 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:20,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 17:43:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:21,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:43:21,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:21,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:43:21,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:21,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368313616] [2024-10-11 17:43:21,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368313616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:43:21,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:43:21,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:43:21,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576003931] [2024-10-11 17:43:21,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:43:21,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:43:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:21,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:43:21,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:43:21,183 INFO L87 Difference]: Start difference. First operand 384 states and 483 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:43:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:21,407 INFO L93 Difference]: Finished difference Result 390 states and 491 transitions. [2024-10-11 17:43:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:43:21,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2024-10-11 17:43:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:21,410 INFO L225 Difference]: With dead ends: 390 [2024-10-11 17:43:21,410 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 17:43:21,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:43:21,411 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 17 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:21,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1126 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:43:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 17:43:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2024-10-11 17:43:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 354 states have (on average 1.2485875706214689) internal successors, (442), 361 states have internal predecessors, (442), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2024-10-11 17:43:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2024-10-11 17:43:21,423 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 60 [2024-10-11 17:43:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:21,423 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2024-10-11 17:43:21,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:43:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2024-10-11 17:43:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 17:43:21,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:21,425 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] [2024-10-11 17:43:21,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 17:43:21,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:21,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:21,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash 468705426, now seen corresponding path program 1 times [2024-10-11 17:43:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516656600] [2024-10-11 17:43:21,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:21,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:21,630 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:21,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 17:43:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:21,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:43:21,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:21,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:43:21,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:21,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516656600] [2024-10-11 17:43:21,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516656600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:43:21,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:43:21,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:43:21,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338189005] [2024-10-11 17:43:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:43:21,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:43:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:43:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:43:21,995 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:43:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:22,081 INFO L93 Difference]: Finished difference Result 389 states and 490 transitions. [2024-10-11 17:43:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:43:22,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2024-10-11 17:43:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:22,083 INFO L225 Difference]: With dead ends: 389 [2024-10-11 17:43:22,083 INFO L226 Difference]: Without dead ends: 389 [2024-10-11 17:43:22,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:43:22,084 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 0 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:22,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 922 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:43:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-11 17:43:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-11 17:43:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 355 states have (on average 1.2507042253521128) internal successors, (444), 363 states have internal predecessors, (444), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-11 17:43:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 490 transitions. [2024-10-11 17:43:22,097 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 490 transitions. Word has length 65 [2024-10-11 17:43:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:22,099 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 490 transitions. [2024-10-11 17:43:22,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:43:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 490 transitions. [2024-10-11 17:43:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 17:43:22,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:22,101 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] [2024-10-11 17:43:22,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 17:43:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:22,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -638364359, now seen corresponding path program 1 times [2024-10-11 17:43:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372620299] [2024-10-11 17:43:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:22,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:22,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:22,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:22,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 17:43:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:22,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:43:22,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:22,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:43:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:22,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372620299] [2024-10-11 17:43:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372620299] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:43:22,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:43:22,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:43:22,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743707961] [2024-10-11 17:43:22,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:43:22,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:43:22,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:22,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:43:22,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:43:22,775 INFO L87 Difference]: Start difference. First operand 389 states and 490 transitions. Second operand has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 17:43:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:22,987 INFO L93 Difference]: Finished difference Result 398 states and 504 transitions. [2024-10-11 17:43:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:43:22,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-10-11 17:43:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:22,989 INFO L225 Difference]: With dead ends: 398 [2024-10-11 17:43:22,990 INFO L226 Difference]: Without dead ends: 398 [2024-10-11 17:43:22,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:43:22,990 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 5 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:22,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1224 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:43:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-11 17:43:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2024-10-11 17:43:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 362 states have (on average 1.2624309392265194) internal successors, (457), 370 states have internal predecessors, (457), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-11 17:43:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 503 transitions. [2024-10-11 17:43:23,000 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 503 transitions. Word has length 66 [2024-10-11 17:43:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:23,001 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 503 transitions. [2024-10-11 17:43:23,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 17:43:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 503 transitions. [2024-10-11 17:43:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 17:43:23,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:23,002 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-10-11 17:43:23,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 17:43:23,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:23,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 997937746, now seen corresponding path program 2 times [2024-10-11 17:43:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471191955] [2024-10-11 17:43:23,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:43:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:23,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:23,206 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:23,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 17:43:23,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:43:23,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:43:23,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:43:23,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:23,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:43:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:43:24,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:24,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471191955] [2024-10-11 17:43:24,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471191955] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:43:24,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:43:24,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:43:24,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230323098] [2024-10-11 17:43:24,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:43:24,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:43:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:24,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:43:24,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:43:24,093 INFO L87 Difference]: Start difference. First operand 397 states and 503 transitions. Second operand has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 17:43:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:24,831 INFO L93 Difference]: Finished difference Result 409 states and 522 transitions. [2024-10-11 17:43:24,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:43:24,831 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2024-10-11 17:43:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:24,833 INFO L225 Difference]: With dead ends: 409 [2024-10-11 17:43:24,833 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 17:43:24,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 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-10-11 17:43:24,834 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 7 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:24,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3054 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:43:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 17:43:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 406. [2024-10-11 17:43:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 371 states have (on average 1.2641509433962264) internal successors, (469), 379 states have internal predecessors, (469), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-11 17:43:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 515 transitions. [2024-10-11 17:43:24,848 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 515 transitions. Word has length 69 [2024-10-11 17:43:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:24,848 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 515 transitions. [2024-10-11 17:43:24,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 17:43:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 515 transitions. [2024-10-11 17:43:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 17:43:24,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:24,850 INFO L215 NwaCegarLoop]: trace histogram [10, 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] [2024-10-11 17:43:24,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 17:43:25,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:25,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:25,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:25,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1628202766, now seen corresponding path program 3 times [2024-10-11 17:43:25,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:25,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206866510] [2024-10-11 17:43:25,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:43:25,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:25,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:25,052 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:25,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 17:43:25,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:43:25,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:43:25,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 17:43:25,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 17:43:25,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:43:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 17:43:25,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206866510] [2024-10-11 17:43:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206866510] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:43:25,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:43:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 17:43:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267399858] [2024-10-11 17:43:25,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:43:25,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:43:25,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:43:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:43:25,843 INFO L87 Difference]: Start difference. First operand 406 states and 515 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:43:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:27,460 INFO L93 Difference]: Finished difference Result 3083 states and 3979 transitions. [2024-10-11 17:43:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 17:43:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2024-10-11 17:43:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:27,475 INFO L225 Difference]: With dead ends: 3083 [2024-10-11 17:43:27,476 INFO L226 Difference]: Without dead ends: 3083 [2024-10-11 17:43:27,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-10-11 17:43:27,477 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 4875 mSDsluCounter, 4446 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 5308 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:27,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 5308 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 17:43:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2024-10-11 17:43:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2121. [2024-10-11 17:43:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1983 states have (on average 1.2778618255168936) internal successors, (2534), 2004 states have internal predecessors, (2534), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-11 17:43:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2734 transitions. [2024-10-11 17:43:27,556 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2734 transitions. Word has length 75 [2024-10-11 17:43:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:27,556 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2734 transitions. [2024-10-11 17:43:27,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:43:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2734 transitions. [2024-10-11 17:43:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 17:43:27,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:27,559 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:43:27,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 17:43:27,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:27,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:27,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash 249438597, now seen corresponding path program 1 times [2024-10-11 17:43:27,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:27,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920785752] [2024-10-11 17:43:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:27,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:27,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:27,763 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:27,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 17:43:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:28,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 17:43:28,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 17:43:28,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:43:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 17:43:29,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920785752] [2024-10-11 17:43:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920785752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:43:29,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:43:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:43:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014472939] [2024-10-11 17:43:29,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:43:29,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:43:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:29,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:43:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:43:29,272 INFO L87 Difference]: Start difference. First operand 2121 states and 2734 transitions. Second operand has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 17:43:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:31,877 INFO L93 Difference]: Finished difference Result 2226 states and 2919 transitions. [2024-10-11 17:43:31,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 17:43:31,878 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2024-10-11 17:43:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:31,888 INFO L225 Difference]: With dead ends: 2226 [2024-10-11 17:43:31,888 INFO L226 Difference]: Without dead ends: 2216 [2024-10-11 17:43:31,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 17:43:31,890 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 14 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4274 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:31,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4274 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 17:43:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-10-11 17:43:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2211. [2024-10-11 17:43:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2073 states have (on average 1.2802701398938736) internal successors, (2654), 2094 states have internal predecessors, (2654), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-11 17:43:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2854 transitions. [2024-10-11 17:43:31,936 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2854 transitions. Word has length 111 [2024-10-11 17:43:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:31,937 INFO L471 AbstractCegarLoop]: Abstraction has 2211 states and 2854 transitions. [2024-10-11 17:43:31,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 17:43:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2854 transitions. [2024-10-11 17:43:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 17:43:31,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:31,939 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:43:31,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 17:43:32,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:32,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:32,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1525892965, now seen corresponding path program 2 times [2024-10-11 17:43:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029941976] [2024-10-11 17:43:32,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:43:32,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:32,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:32,142 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:32,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 17:43:32,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:43:32,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:43:32,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:43:32,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:32,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:43:32,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:43:32,501 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:43:32,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-11 17:43:32,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:43:32,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-11 17:43:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-10-11 17:43:32,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:43:32,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:32,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029941976] [2024-10-11 17:43:32,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029941976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:43:32,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:43:32,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:43:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202671317] [2024-10-11 17:43:32,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:43:32,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:43:32,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:43:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:43:32,571 INFO L87 Difference]: Start difference. First operand 2211 states and 2854 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 17:43:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:32,937 INFO L93 Difference]: Finished difference Result 2963 states and 3856 transitions. [2024-10-11 17:43:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:43:32,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 129 [2024-10-11 17:43:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:32,948 INFO L225 Difference]: With dead ends: 2963 [2024-10-11 17:43:32,948 INFO L226 Difference]: Without dead ends: 2963 [2024-10-11 17:43:32,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:43:32,949 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 212 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:32,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 867 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:43:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2024-10-11 17:43:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2223. [2024-10-11 17:43:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2085 states have (on average 1.2786570743405277) internal successors, (2666), 2106 states have internal predecessors, (2666), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-11 17:43:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2866 transitions. [2024-10-11 17:43:32,998 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2866 transitions. Word has length 129 [2024-10-11 17:43:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:32,999 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 2866 transitions. [2024-10-11 17:43:32,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 17:43:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2866 transitions. [2024-10-11 17:43:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 17:43:33,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:33,001 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 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-10-11 17:43:33,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 17:43:33,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:33,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:33,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1915621368, now seen corresponding path program 1 times [2024-10-11 17:43:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:33,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068889617] [2024-10-11 17:43:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:43:33,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:33,205 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:33,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 17:43:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:43:33,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 17:43:33,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 311 proven. 253 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 17:43:34,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:43:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-11 17:43:36,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:36,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068889617] [2024-10-11 17:43:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068889617] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:43:36,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:43:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 17:43:36,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46054510] [2024-10-11 17:43:36,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:43:36,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 17:43:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 17:43:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 17:43:36,327 INFO L87 Difference]: Start difference. First operand 2223 states and 2866 transitions. Second operand has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 17:43:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:43:46,820 INFO L93 Difference]: Finished difference Result 2408 states and 3211 transitions. [2024-10-11 17:43:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 17:43:46,821 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 133 [2024-10-11 17:43:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:43:46,829 INFO L225 Difference]: With dead ends: 2408 [2024-10-11 17:43:46,829 INFO L226 Difference]: Without dead ends: 2398 [2024-10-11 17:43:46,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 17:43:46,833 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 25 mSDsluCounter, 7320 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7629 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:43:46,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7629 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 17:43:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2024-10-11 17:43:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2393. [2024-10-11 17:43:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2255 states have (on average 1.2842572062084257) internal successors, (2896), 2276 states have internal predecessors, (2896), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-11 17:43:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3096 transitions. [2024-10-11 17:43:46,874 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3096 transitions. Word has length 133 [2024-10-11 17:43:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:43:46,874 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3096 transitions. [2024-10-11 17:43:46,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 17:43:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3096 transitions. [2024-10-11 17:43:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 17:43:46,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:43:46,876 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 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-10-11 17:43:46,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 17:43:47,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:47,077 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:43:47,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:43:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1083881752, now seen corresponding path program 2 times [2024-10-11 17:43:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:43:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082007042] [2024-10-11 17:43:47,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:43:47,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:43:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:43:47,080 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:43:47,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 17:43:48,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:43:48,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:43:48,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 17:43:48,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:43:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1162 proven. 276 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2024-10-11 17:43:49,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:43:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1081 proven. 301 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2024-10-11 17:43:51,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:43:51,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082007042] [2024-10-11 17:43:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082007042] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:43:51,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:43:51,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-11 17:43:51,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154736773] [2024-10-11 17:43:51,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:43:51,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 17:43:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:43:51,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 17:43:51,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 17:43:51,286 INFO L87 Difference]: Start difference. First operand 2393 states and 3096 transitions. Second operand has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 17:44:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:44:04,081 INFO L93 Difference]: Finished difference Result 2528 states and 3356 transitions. [2024-10-11 17:44:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-11 17:44:04,081 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 167 [2024-10-11 17:44:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:44:04,090 INFO L225 Difference]: With dead ends: 2528 [2024-10-11 17:44:04,090 INFO L226 Difference]: Without dead ends: 2528 [2024-10-11 17:44:04,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-11 17:44:04,093 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 26 mSDsluCounter, 7320 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7628 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 17:44:04,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7628 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 17:44:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2024-10-11 17:44:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2518. [2024-10-11 17:44:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2380 states have (on average 1.3218487394957983) internal successors, (3146), 2401 states have internal predecessors, (3146), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-11 17:44:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3346 transitions. [2024-10-11 17:44:04,137 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3346 transitions. Word has length 167 [2024-10-11 17:44:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:44:04,137 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3346 transitions. [2024-10-11 17:44:04,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 17:44:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3346 transitions. [2024-10-11 17:44:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 17:44:04,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:44:04,139 INFO L215 NwaCegarLoop]: trace histogram [92, 3, 3, 3, 3, 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-10-11 17:44:04,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 17:44:04,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:44:04,340 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:44:04,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:44:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash -309569537, now seen corresponding path program 3 times [2024-10-11 17:44:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:44:04,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818458722] [2024-10-11 17:44:04,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:44:04,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:44:04,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:44:04,343 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:44:04,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 17:44:05,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:44:05,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:44:05,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 17:44:05,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:44:05,404 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 44 treesize of output 53 [2024-10-11 17:44:05,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 334 [2024-10-11 17:44:05,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 214 [2024-10-11 17:44:05,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:44:05,709 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 214 treesize of output 94 [2024-10-11 17:44:07,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-10-11 17:44:07,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-10-11 17:44:07,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:44:07,157 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 68 treesize of output 20 [2024-10-11 17:44:07,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:44:07,518 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 214 treesize of output 106 [2024-10-11 17:44:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4483 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 4379 trivial. 0 not checked. [2024-10-11 17:44:07,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:44:07,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:44:07,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818458722] [2024-10-11 17:44:07,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818458722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:44:07,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:44:07,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 17:44:07,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086644841] [2024-10-11 17:44:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:44:07,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:44:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:44:07,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:44:07,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:44:07,726 INFO L87 Difference]: Start difference. First operand 2518 states and 3346 transitions. Second operand has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 17:44:09,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:44:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:44:15,548 INFO L93 Difference]: Finished difference Result 3149 states and 4176 transitions. [2024-10-11 17:44:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 17:44:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 192 [2024-10-11 17:44:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:44:15,559 INFO L225 Difference]: With dead ends: 3149 [2024-10-11 17:44:15,560 INFO L226 Difference]: Without dead ends: 3144 [2024-10-11 17:44:15,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:44:15,561 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 371 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:44:15,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 3085 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-10-11 17:44:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2024-10-11 17:44:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2781. [2024-10-11 17:44:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2627 states have (on average 1.3090978302245908) internal successors, (3439), 2651 states have internal predecessors, (3439), 108 states have call successors, (108), 41 states have call predecessors, (108), 44 states have return successors, (117), 88 states have call predecessors, (117), 104 states have call successors, (117) [2024-10-11 17:44:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3664 transitions. [2024-10-11 17:44:15,602 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3664 transitions. Word has length 192 [2024-10-11 17:44:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:44:15,602 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3664 transitions. [2024-10-11 17:44:15,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 17:44:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3664 transitions. [2024-10-11 17:44:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 17:44:15,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:44:15,604 INFO L215 NwaCegarLoop]: trace histogram [93, 3, 3, 3, 3, 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-10-11 17:44:15,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 17:44:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:44:15,805 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:44:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:44:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash -711273574, now seen corresponding path program 4 times [2024-10-11 17:44:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:44:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690531208] [2024-10-11 17:44:15,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:44:15,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:44:15,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:44:15,807 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:44:15,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 17:44:17,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:44:17,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:44:17,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 17:44:17,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:44:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2406 proven. 1176 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-10-11 17:44:19,676 INFO L311 TraceCheckSpWp]: Computing backward predicates...