./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:01:05,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:01:05,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:01:05,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:01:05,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:01:05,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:01:05,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:01:05,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:01:05,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:01:05,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:01:05,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:01:05,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:01:05,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:01:05,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:01:05,503 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:01:05,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:01:05,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:01:05,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:01:05,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:01:05,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:01:05,505 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:01:05,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:01:05,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:01:05,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:01:05,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:01:05,510 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:01:05,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:01:05,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:01:05,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:01:05,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:01:05,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:01:05,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:01:05,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:01:05,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:01:05,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:01:05,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:01:05,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:01:05,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:01:05,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:01:05,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:01:05,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:01:05,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:01:05,514 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2024-10-14 19:01:05,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:01:05,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:01:05,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:01:05,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:01:05,759 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:01:05,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-14 19:01:07,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:01:07,335 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:01:07,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-14 19:01:07,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad286a71/6cdf2d8d18bf47af8f6ef3f8330146bf/FLAG283727aa3 [2024-10-14 19:01:07,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad286a71/6cdf2d8d18bf47af8f6ef3f8330146bf [2024-10-14 19:01:07,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:01:07,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:01:07,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:01:07,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:01:07,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:01:07,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:01:07" (1/1) ... [2024-10-14 19:01:07,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2318596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:07, skipping insertion in model container [2024-10-14 19:01:07,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:01:07" (1/1) ... [2024-10-14 19:01:07,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:01:08,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:01:08,241 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 19:01:08,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@490fc04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:08, skipping insertion in model container [2024-10-14 19:01:08,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:01:08,245 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:01:08,247 INFO L158 Benchmark]: Toolchain (without parser) took 621.03ms. Allocated memory is still 151.0MB. Free memory was 94.5MB in the beginning and 71.1MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 19:01:08,247 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:01:08,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.78ms. Allocated memory is still 151.0MB. Free memory was 94.1MB in the beginning and 71.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 19:01:08,249 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.16ms. Allocated memory is still 151.0MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.78ms. Allocated memory is still 151.0MB. Free memory was 94.1MB in the beginning and 71.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:01:09,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:01:10,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:01:10,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:01:10,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:01:10,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:01:10,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:01:10,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:01:10,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:01:10,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:01:10,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:01:10,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:01:10,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:01:10,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:01:10,105 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:01:10,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:01:10,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:01:10,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:01:10,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:01:10,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:01:10,107 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:01:10,108 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:01:10,108 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:01:10,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:01:10,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:01:10,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:01:10,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:01:10,109 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:01:10,109 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:01:10,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:01:10,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:01:10,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:01:10,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:01:10,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:01:10,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:01:10,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:01:10,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:01:10,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:01:10,113 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:01:10,113 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:01:10,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:01:10,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:01:10,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:01:10,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:01:10,114 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:01:10,115 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2024-10-14 19:01:10,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:01:10,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:01:10,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:01:10,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:01:10,439 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:01:10,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-14 19:01:11,753 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:01:12,020 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:01:12,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-14 19:01:12,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f56834c3/6857268278d246d2b60ab4c60b431e43/FLAG2b9a25dcc [2024-10-14 19:01:12,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f56834c3/6857268278d246d2b60ab4c60b431e43 [2024-10-14 19:01:12,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:01:12,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:01:12,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:01:12,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:01:12,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:01:12,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:12,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba87f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12, skipping insertion in model container [2024-10-14 19:01:12,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:12,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:01:12,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:01:12,721 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:01:12,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:01:12,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:01:12,838 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:01:12,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:01:12,961 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:01:12,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12 WrapperNode [2024-10-14 19:01:12,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:01:12,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:01:12,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:01:12,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:01:12,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,085 INFO L138 Inliner]: procedures = 285, calls = 290, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1069 [2024-10-14 19:01:13,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:01:13,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:01:13,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:01:13,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:01:13,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,172 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 3, 34, 220]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 2, 4, 49]. [2024-10-14 19:01:13,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:01:13,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:01:13,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:01:13,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:01:13,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (1/1) ... [2024-10-14 19:01:13,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:01:13,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:01:13,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:01:13,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:01:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 19:01:13,309 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 19:01:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:01:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:01:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:01:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 19:01:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:01:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:01:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:01:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 19:01:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:01:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:01:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:01:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:01:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 19:01:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 19:01:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-14 19:01:13,316 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-14 19:01:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 19:01:13,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 19:01:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:01:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:01:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-14 19:01:13,317 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-14 19:01:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:01:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:01:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:01:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 19:01:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-14 19:01:13,318 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-14 19:01:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:01:13,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:01:13,541 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:01:13,543 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:01:16,658 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-10-14 19:01:16,659 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:01:16,781 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:01:16,784 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 19:01:16,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:01:16 BoogieIcfgContainer [2024-10-14 19:01:16,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:01:16,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:01:16,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:01:16,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:01:16,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:01:12" (1/3) ... [2024-10-14 19:01:16,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39649564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:01:16, skipping insertion in model container [2024-10-14 19:01:16,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:01:12" (2/3) ... [2024-10-14 19:01:16,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39649564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:01:16, skipping insertion in model container [2024-10-14 19:01:16,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:01:16" (3/3) ... [2024-10-14 19:01:16,791 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-1.i [2024-10-14 19:01:16,804 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:01:16,805 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 522 error locations. [2024-10-14 19:01:16,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:01:16,870 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;@11acc685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:01:16,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2024-10-14 19:01:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 977 states, 432 states have (on average 2.497685185185185) internal successors, (1079), 957 states have internal predecessors, (1079), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 19:01:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:01:16,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:16,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:01:16,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:16,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash 55116, now seen corresponding path program 1 times [2024-10-14 19:01:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:16,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858002535] [2024-10-14 19:01:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:16,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:16,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:16,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:01:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:17,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:17,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:17,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:01:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:17,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:17,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858002535] [2024-10-14 19:01:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858002535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:01:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971881634] [2024-10-14 19:01:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:17,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:17,138 INFO L87 Difference]: Start difference. First operand has 977 states, 432 states have (on average 2.497685185185185) internal successors, (1079), 957 states have internal predecessors, (1079), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:18,585 INFO L93 Difference]: Finished difference Result 1048 states and 1118 transitions. [2024-10-14 19:01:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:18,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:01:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:18,600 INFO L225 Difference]: With dead ends: 1048 [2024-10-14 19:01:18,600 INFO L226 Difference]: Without dead ends: 1047 [2024-10-14 19:01:18,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:18,605 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 649 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:18,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 854 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:01:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-10-14 19:01:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 990. [2024-10-14 19:01:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 460 states have (on average 2.3239130434782607) internal successors, (1069), 972 states have internal predecessors, (1069), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1099 transitions. [2024-10-14 19:01:18,692 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1099 transitions. Word has length 2 [2024-10-14 19:01:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1099 transitions. [2024-10-14 19:01:18,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1099 transitions. [2024-10-14 19:01:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:01:18,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:18,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:01:18,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:01:18,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:18,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:18,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash 55117, now seen corresponding path program 1 times [2024-10-14 19:01:18,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361103547] [2024-10-14 19:01:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:18,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:18,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:18,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:18,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:01:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:19,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:01:19,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:19,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-14 19:01:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:19,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:19,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:19,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361103547] [2024-10-14 19:01:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361103547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:19,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:01:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686421420] [2024-10-14 19:01:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:19,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:19,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:19,045 INFO L87 Difference]: Start difference. First operand 990 states and 1099 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:21,138 INFO L93 Difference]: Finished difference Result 1355 states and 1501 transitions. [2024-10-14 19:01:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:21,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:01:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:21,143 INFO L225 Difference]: With dead ends: 1355 [2024-10-14 19:01:21,143 INFO L226 Difference]: Without dead ends: 1355 [2024-10-14 19:01:21,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:21,144 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 389 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:21,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1260 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 19:01:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-10-14 19:01:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1164. [2024-10-14 19:01:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 633 states have (on average 2.2985781990521326) internal successors, (1455), 1144 states have internal predecessors, (1455), 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-14 19:01:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1489 transitions. [2024-10-14 19:01:21,169 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1489 transitions. Word has length 2 [2024-10-14 19:01:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:21,170 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1489 transitions. [2024-10-14 19:01:21,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1489 transitions. [2024-10-14 19:01:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 19:01:21,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:21,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:01:21,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:21,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:21,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:21,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash -636050060, now seen corresponding path program 1 times [2024-10-14 19:01:21,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:21,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644044397] [2024-10-14 19:01:21,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:21,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:21,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:21,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:21,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:01:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:21,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:01:21,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:21,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:01:21,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-14 19:01:21,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:01:21,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:01:21,590 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:01:21,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:01:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:21,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:21,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:21,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644044397] [2024-10-14 19:01:21,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644044397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:21,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:21,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:01:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83358486] [2024-10-14 19:01:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:21,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:21,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:21,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:21,614 INFO L87 Difference]: Start difference. First operand 1164 states and 1489 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:24,947 INFO L93 Difference]: Finished difference Result 1798 states and 2181 transitions. [2024-10-14 19:01:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:24,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 19:01:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:24,956 INFO L225 Difference]: With dead ends: 1798 [2024-10-14 19:01:24,956 INFO L226 Difference]: Without dead ends: 1798 [2024-10-14 19:01:24,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:24,960 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 662 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:24,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 1235 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 19:01:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-10-14 19:01:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1280. [2024-10-14 19:01:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 749 states have (on average 2.281708945260347) internal successors, (1709), 1260 states have internal predecessors, (1709), 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-14 19:01:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1743 transitions. [2024-10-14 19:01:24,983 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1743 transitions. Word has length 6 [2024-10-14 19:01:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:24,984 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1743 transitions. [2024-10-14 19:01:24,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1743 transitions. [2024-10-14 19:01:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:01:24,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:24,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:24,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:25,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:25,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:25,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1757284643, now seen corresponding path program 1 times [2024-10-14 19:01:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429065393] [2024-10-14 19:01:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:25,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:25,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:25,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:25,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:01:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:25,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:25,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:25,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:01:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:25,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:25,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429065393] [2024-10-14 19:01:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429065393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:25,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:01:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094210987] [2024-10-14 19:01:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:25,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:25,325 INFO L87 Difference]: Start difference. First operand 1280 states and 1743 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:26,651 INFO L93 Difference]: Finished difference Result 1754 states and 2445 transitions. [2024-10-14 19:01:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:26,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:01:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:26,656 INFO L225 Difference]: With dead ends: 1754 [2024-10-14 19:01:26,657 INFO L226 Difference]: Without dead ends: 1754 [2024-10-14 19:01:26,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:26,660 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 830 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:26,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1066 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:01:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2024-10-14 19:01:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1235. [2024-10-14 19:01:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 749 states have (on average 2.202937249666222) internal successors, (1650), 1215 states have internal predecessors, (1650), 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-14 19:01:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1684 transitions. [2024-10-14 19:01:26,682 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1684 transitions. Word has length 7 [2024-10-14 19:01:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:26,683 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1684 transitions. [2024-10-14 19:01:26,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1684 transitions. [2024-10-14 19:01:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:01:26,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:26,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:26,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:26,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:26,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:26,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:26,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1757284644, now seen corresponding path program 1 times [2024-10-14 19:01:26,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:26,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847973612] [2024-10-14 19:01:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:26,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:26,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:26,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:26,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:01:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:26,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:01:26,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:26,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-14 19:01:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:27,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:27,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847973612] [2024-10-14 19:01:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847973612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:01:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510556380] [2024-10-14 19:01:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:27,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:27,013 INFO L87 Difference]: Start difference. First operand 1235 states and 1684 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:28,853 INFO L93 Difference]: Finished difference Result 1809 states and 2458 transitions. [2024-10-14 19:01:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:01:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:28,858 INFO L225 Difference]: With dead ends: 1809 [2024-10-14 19:01:28,858 INFO L226 Difference]: Without dead ends: 1809 [2024-10-14 19:01:28,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:28,859 INFO L432 NwaCegarLoop]: 973 mSDtfsCounter, 633 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:28,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1338 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:01:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-10-14 19:01:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1227. [2024-10-14 19:01:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 751 states have (on average 2.1677762982689748) internal successors, (1628), 1207 states have internal predecessors, (1628), 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-14 19:01:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1662 transitions. [2024-10-14 19:01:28,880 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1662 transitions. Word has length 7 [2024-10-14 19:01:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:28,880 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1662 transitions. [2024-10-14 19:01:28,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1662 transitions. [2024-10-14 19:01:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:01:28,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:28,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:28,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:01:29,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:29,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:29,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2143508545, now seen corresponding path program 1 times [2024-10-14 19:01:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:29,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138324517] [2024-10-14 19:01:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:29,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:29,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:01:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:29,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:01:29,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:29,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:29,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:29,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138324517] [2024-10-14 19:01:29,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138324517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:29,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:29,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569311115] [2024-10-14 19:01:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:29,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:29,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:29,249 INFO L87 Difference]: Start difference. First operand 1227 states and 1662 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:30,386 INFO L93 Difference]: Finished difference Result 1627 states and 2172 transitions. [2024-10-14 19:01:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-10-14 19:01:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:30,391 INFO L225 Difference]: With dead ends: 1627 [2024-10-14 19:01:30,391 INFO L226 Difference]: Without dead ends: 1627 [2024-10-14 19:01:30,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:30,392 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 406 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:30,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 2525 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:01:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-10-14 19:01:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1437. [2024-10-14 19:01:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 961 states have (on average 2.1800208116545265) internal successors, (2095), 1417 states have internal predecessors, (2095), 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-14 19:01:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2129 transitions. [2024-10-14 19:01:30,417 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2129 transitions. Word has length 12 [2024-10-14 19:01:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:30,417 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2129 transitions. [2024-10-14 19:01:30,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2129 transitions. [2024-10-14 19:01:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:01:30,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:30,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:30,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 19:01:30,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:30,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:30,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1554900703, now seen corresponding path program 1 times [2024-10-14 19:01:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:30,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793302348] [2024-10-14 19:01:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:30,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:30,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:01:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:30,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:01:30,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:30,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:30,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793302348] [2024-10-14 19:01:30,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793302348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:30,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:30,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:30,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684801239] [2024-10-14 19:01:30,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:30,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:30,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:30,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:30,747 INFO L87 Difference]: Start difference. First operand 1437 states and 2129 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:31,227 INFO L93 Difference]: Finished difference Result 1353 states and 1969 transitions. [2024-10-14 19:01:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:31,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 19:01:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:31,232 INFO L225 Difference]: With dead ends: 1353 [2024-10-14 19:01:31,232 INFO L226 Difference]: Without dead ends: 1353 [2024-10-14 19:01:31,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:31,233 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 61 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:31,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1582 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:01:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-14 19:01:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-10-14 19:01:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 901 states have (on average 2.1476137624861265) internal successors, (1935), 1333 states have internal predecessors, (1935), 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-14 19:01:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1969 transitions. [2024-10-14 19:01:31,255 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1969 transitions. Word has length 12 [2024-10-14 19:01:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:31,255 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1969 transitions. [2024-10-14 19:01:31,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1969 transitions. [2024-10-14 19:01:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:01:31,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:31,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:31,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:31,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:31,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:31,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:31,457 INFO L85 PathProgramCache]: Analyzing trace with hash 201952929, now seen corresponding path program 1 times [2024-10-14 19:01:31,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:31,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920541822] [2024-10-14 19:01:31,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:31,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:31,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:31,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:31,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:01:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:31,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:01:31,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:31,592 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:31,592 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:31,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:31,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-14 19:01:31,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:01:31,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 19:01:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:31,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:31,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920541822] [2024-10-14 19:01:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920541822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:31,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:31,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836037593] [2024-10-14 19:01:31,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:31,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:31,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:31,636 INFO L87 Difference]: Start difference. First operand 1353 states and 1969 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-14 19:01:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:32,615 INFO L93 Difference]: Finished difference Result 1853 states and 2258 transitions. [2024-10-14 19:01:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-10-14 19:01:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:32,620 INFO L225 Difference]: With dead ends: 1853 [2024-10-14 19:01:32,621 INFO L226 Difference]: Without dead ends: 1853 [2024-10-14 19:01:32,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:32,621 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 809 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:32,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2678 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:01:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-10-14 19:01:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1082. [2024-10-14 19:01:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 632 states have (on average 2.1297468354430378) internal successors, (1346), 1064 states have internal predecessors, (1346), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1376 transitions. [2024-10-14 19:01:32,639 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1376 transitions. Word has length 15 [2024-10-14 19:01:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:32,639 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1376 transitions. [2024-10-14 19:01:32,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-14 19:01:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1376 transitions. [2024-10-14 19:01:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:01:32,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:32,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:32,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:01:32,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:32,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1507469734, now seen corresponding path program 1 times [2024-10-14 19:01:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:32,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062127486] [2024-10-14 19:01:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:32,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:32,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:32,843 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:32,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 19:01:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:32,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:01:32,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:32,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:32,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062127486] [2024-10-14 19:01:32,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062127486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:32,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:32,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476830914] [2024-10-14 19:01:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:32,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:32,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:32,982 INFO L87 Difference]: Start difference. First operand 1082 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:33,422 INFO L93 Difference]: Finished difference Result 1028 states and 1296 transitions. [2024-10-14 19:01:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 19:01:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:33,425 INFO L225 Difference]: With dead ends: 1028 [2024-10-14 19:01:33,426 INFO L226 Difference]: Without dead ends: 1028 [2024-10-14 19:01:33,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:33,426 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 61 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:33,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1508 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:01:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2024-10-14 19:01:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2024-10-14 19:01:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 602 states have (on average 2.1029900332225915) internal successors, (1266), 1010 states have internal predecessors, (1266), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1296 transitions. [2024-10-14 19:01:33,438 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1296 transitions. Word has length 15 [2024-10-14 19:01:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:33,438 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1296 transitions. [2024-10-14 19:01:33,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1296 transitions. [2024-10-14 19:01:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:01:33,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:33,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:33,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 19:01:33,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:33,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:33,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1274437676, now seen corresponding path program 1 times [2024-10-14 19:01:33,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:33,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041415175] [2024-10-14 19:01:33,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:33,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:33,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:33,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:33,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 19:01:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:33,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:33,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:33,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:33,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:33,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041415175] [2024-10-14 19:01:33,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041415175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:33,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:33,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:33,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309658786] [2024-10-14 19:01:33,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:33,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:33,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:33,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:33,783 INFO L87 Difference]: Start difference. First operand 1028 states and 1296 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:34,413 INFO L93 Difference]: Finished difference Result 1012 states and 1252 transitions. [2024-10-14 19:01:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:01:34,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 19:01:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:34,417 INFO L225 Difference]: With dead ends: 1012 [2024-10-14 19:01:34,417 INFO L226 Difference]: Without dead ends: 1012 [2024-10-14 19:01:34,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:34,417 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 45 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:34,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2214 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:01:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-10-14 19:01:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2024-10-14 19:01:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 600 states have (on average 2.0366666666666666) internal successors, (1222), 994 states have internal predecessors, (1222), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1252 transitions. [2024-10-14 19:01:34,429 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1252 transitions. Word has length 17 [2024-10-14 19:01:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:34,429 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1252 transitions. [2024-10-14 19:01:34,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1252 transitions. [2024-10-14 19:01:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:01:34,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:34,431 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] [2024-10-14 19:01:34,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:34,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:34,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:34,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1196089309, now seen corresponding path program 1 times [2024-10-14 19:01:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:34,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412966962] [2024-10-14 19:01:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:34,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:34,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:34,634 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:34,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 19:01:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:34,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:01:34,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:34,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-14 19:01:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:34,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:34,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412966962] [2024-10-14 19:01:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412966962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:34,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:34,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:34,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064727047] [2024-10-14 19:01:34,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:34,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:34,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:34,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:34,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:34,959 INFO L87 Difference]: Start difference. First operand 1012 states and 1252 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:37,261 INFO L93 Difference]: Finished difference Result 1498 states and 1865 transitions. [2024-10-14 19:01:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 19:01:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:37,265 INFO L225 Difference]: With dead ends: 1498 [2024-10-14 19:01:37,265 INFO L226 Difference]: Without dead ends: 1498 [2024-10-14 19:01:37,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:37,266 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 535 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:37,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1900 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 19:01:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-14 19:01:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1008. [2024-10-14 19:01:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 600 states have (on average 2.0233333333333334) internal successors, (1214), 990 states have internal predecessors, (1214), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1244 transitions. [2024-10-14 19:01:37,277 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1244 transitions. Word has length 31 [2024-10-14 19:01:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:37,277 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1244 transitions. [2024-10-14 19:01:37,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1244 transitions. [2024-10-14 19:01:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:01:37,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:37,279 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] [2024-10-14 19:01:37,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:37,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:37,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:37,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1196089310, now seen corresponding path program 1 times [2024-10-14 19:01:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499201850] [2024-10-14 19:01:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:37,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:37,483 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:37,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 19:01:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:37,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:01:37,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:37,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:01:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:37,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:37,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:37,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499201850] [2024-10-14 19:01:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499201850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:37,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013312192] [2024-10-14 19:01:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:37,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:37,677 INFO L87 Difference]: Start difference. First operand 1008 states and 1244 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:39,188 INFO L93 Difference]: Finished difference Result 1387 states and 1744 transitions. [2024-10-14 19:01:39,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:39,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 19:01:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:39,192 INFO L225 Difference]: With dead ends: 1387 [2024-10-14 19:01:39,192 INFO L226 Difference]: Without dead ends: 1387 [2024-10-14 19:01:39,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:39,193 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 728 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:39,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1022 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:01:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-10-14 19:01:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1004. [2024-10-14 19:01:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 600 states have (on average 2.01) internal successors, (1206), 986 states have internal predecessors, (1206), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1236 transitions. [2024-10-14 19:01:39,204 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1236 transitions. Word has length 31 [2024-10-14 19:01:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:39,204 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1236 transitions. [2024-10-14 19:01:39,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1236 transitions. [2024-10-14 19:01:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 19:01:39,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:39,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:39,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 19:01:39,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:39,405 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:39,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1418610896, now seen corresponding path program 1 times [2024-10-14 19:01:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:39,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54082291] [2024-10-14 19:01:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:39,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:39,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:39,409 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:39,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 19:01:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:39,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:39,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:39,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:39,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:39,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54082291] [2024-10-14 19:01:39,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54082291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:39,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:39,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:39,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995806065] [2024-10-14 19:01:39,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:39,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:39,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:39,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:39,658 INFO L87 Difference]: Start difference. First operand 1004 states and 1236 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:40,288 INFO L93 Difference]: Finished difference Result 992 states and 1216 transitions. [2024-10-14 19:01:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:01:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 51 [2024-10-14 19:01:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:40,291 INFO L225 Difference]: With dead ends: 992 [2024-10-14 19:01:40,291 INFO L226 Difference]: Without dead ends: 992 [2024-10-14 19:01:40,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:40,292 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 15 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:40,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2197 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:01:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-10-14 19:01:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2024-10-14 19:01:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 588 states have (on average 2.0170068027210886) internal successors, (1186), 974 states have internal predecessors, (1186), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1216 transitions. [2024-10-14 19:01:40,303 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1216 transitions. Word has length 51 [2024-10-14 19:01:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:40,303 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1216 transitions. [2024-10-14 19:01:40,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1216 transitions. [2024-10-14 19:01:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 19:01:40,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:40,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:40,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:40,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:40,505 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:40,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash -711112527, now seen corresponding path program 1 times [2024-10-14 19:01:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:40,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80996174] [2024-10-14 19:01:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:40,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:40,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:40,518 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:40,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 19:01:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:40,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:01:40,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:40,813 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-14 19:01:40,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-10-14 19:01:40,861 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-14 19:01:40,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2024-10-14 19:01:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:41,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:41,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80996174] [2024-10-14 19:01:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80996174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279934190] [2024-10-14 19:01:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:41,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:01:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:01:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:41,364 INFO L87 Difference]: Start difference. First operand 992 states and 1216 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:43,534 INFO L93 Difference]: Finished difference Result 1810 states and 2219 transitions. [2024-10-14 19:01:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:43,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 55 [2024-10-14 19:01:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:43,538 INFO L225 Difference]: With dead ends: 1810 [2024-10-14 19:01:43,538 INFO L226 Difference]: Without dead ends: 1810 [2024-10-14 19:01:43,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:43,539 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 715 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:43,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1348 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 19:01:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-14 19:01:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1344. [2024-10-14 19:01:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 925 states have (on average 2.0086486486486486) internal successors, (1858), 1314 states have internal predecessors, (1858), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 19:01:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1912 transitions. [2024-10-14 19:01:43,555 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1912 transitions. Word has length 55 [2024-10-14 19:01:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:43,555 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1912 transitions. [2024-10-14 19:01:43,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1912 transitions. [2024-10-14 19:01:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 19:01:43,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:43,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:43,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 19:01:43,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:43,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:43,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash -711112526, now seen corresponding path program 1 times [2024-10-14 19:01:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245674730] [2024-10-14 19:01:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:43,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:43,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:43,759 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:43,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 19:01:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:44,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 19:01:44,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:44,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:01:44,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:01:44,097 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 19:01:44,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 19:01:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:44,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:44,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245674730] [2024-10-14 19:01:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245674730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:44,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:44,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:01:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323678467] [2024-10-14 19:01:44,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:44,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:44,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:44,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:44,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:44,538 INFO L87 Difference]: Start difference. First operand 1344 states and 1912 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:46,148 INFO L93 Difference]: Finished difference Result 1349 states and 1918 transitions. [2024-10-14 19:01:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:46,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 55 [2024-10-14 19:01:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:46,151 INFO L225 Difference]: With dead ends: 1349 [2024-10-14 19:01:46,152 INFO L226 Difference]: Without dead ends: 1349 [2024-10-14 19:01:46,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:46,152 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 0 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:46,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:01:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-10-14 19:01:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2024-10-14 19:01:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 929 states have (on average 2.0043057050592035) internal successors, (1862), 1318 states have internal predecessors, (1862), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 19:01:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1918 transitions. [2024-10-14 19:01:46,166 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1918 transitions. Word has length 55 [2024-10-14 19:01:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:46,166 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1918 transitions. [2024-10-14 19:01:46,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1918 transitions. [2024-10-14 19:01:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 19:01:46,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:46,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:46,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:46,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:46,367 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:46,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash 511752310, now seen corresponding path program 1 times [2024-10-14 19:01:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695930518] [2024-10-14 19:01:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:46,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:46,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:46,369 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:46,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 19:01:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:46,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:01:46,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:46,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:46,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695930518] [2024-10-14 19:01:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695930518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:46,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:01:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345789517] [2024-10-14 19:01:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:46,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:01:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:01:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:01:46,683 INFO L87 Difference]: Start difference. First operand 1349 states and 1918 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:01:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:47,776 INFO L93 Difference]: Finished difference Result 1353 states and 1926 transitions. [2024-10-14 19:01:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:01:47,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-10-14 19:01:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:47,781 INFO L225 Difference]: With dead ends: 1353 [2024-10-14 19:01:47,781 INFO L226 Difference]: Without dead ends: 1353 [2024-10-14 19:01:47,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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-14 19:01:47,782 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 19 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:47,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3590 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:01:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-14 19:01:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1351. [2024-10-14 19:01:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 930 states have (on average 2.003225806451613) internal successors, (1863), 1319 states have internal predecessors, (1863), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (29), 22 states have call predecessors, (29), 26 states have call successors, (29) [2024-10-14 19:01:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1922 transitions. [2024-10-14 19:01:47,797 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1922 transitions. Word has length 59 [2024-10-14 19:01:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:47,797 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1922 transitions. [2024-10-14 19:01:47,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:01:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1922 transitions. [2024-10-14 19:01:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 19:01:47,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:47,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:47,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:47,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:47,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:47,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:47,999 INFO L85 PathProgramCache]: Analyzing trace with hash -918850781, now seen corresponding path program 1 times [2024-10-14 19:01:47,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:47,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700374856] [2024-10-14 19:01:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:48,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:48,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:48,001 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:48,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 19:01:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:48,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:01:48,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:48,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:48,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700374856] [2024-10-14 19:01:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700374856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:48,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:48,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:01:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172886986] [2024-10-14 19:01:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:48,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:01:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:01:48,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:01:48,224 INFO L87 Difference]: Start difference. First operand 1351 states and 1922 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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-14 19:01:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:49,212 INFO L93 Difference]: Finished difference Result 1375 states and 1946 transitions. [2024-10-14 19:01:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:01:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 62 [2024-10-14 19:01:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:49,216 INFO L225 Difference]: With dead ends: 1375 [2024-10-14 19:01:49,216 INFO L226 Difference]: Without dead ends: 1375 [2024-10-14 19:01:49,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 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-14 19:01:49,217 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 13 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:49,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3743 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:01:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-10-14 19:01:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1371. [2024-10-14 19:01:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 944 states have (on average 1.99364406779661) internal successors, (1882), 1335 states have internal predecessors, (1882), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-14 19:01:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1943 transitions. [2024-10-14 19:01:49,236 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1943 transitions. Word has length 62 [2024-10-14 19:01:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:49,236 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1943 transitions. [2024-10-14 19:01:49,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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-14 19:01:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1943 transitions. [2024-10-14 19:01:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 19:01:49,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:49,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:49,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:49,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:49,438 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:49,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1853468852, now seen corresponding path program 1 times [2024-10-14 19:01:49,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382774017] [2024-10-14 19:01:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:49,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:49,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:49,441 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:49,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 19:01:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:49,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:01:49,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:49,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:01:49,912 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-10-14 19:01:49,926 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 19:01:49,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-14 19:01:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:49,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:49,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:49,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382774017] [2024-10-14 19:01:49,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382774017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:49,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:49,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577690056] [2024-10-14 19:01:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:49,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:01:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:49,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:01:49,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-14 19:01:49,939 INFO L87 Difference]: Start difference. First operand 1371 states and 1943 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 19:01:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:51,684 INFO L93 Difference]: Finished difference Result 1745 states and 2441 transitions. [2024-10-14 19:01:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:01:51,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2024-10-14 19:01:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:51,688 INFO L225 Difference]: With dead ends: 1745 [2024-10-14 19:01:51,688 INFO L226 Difference]: Without dead ends: 1745 [2024-10-14 19:01:51,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-14 19:01:51,688 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 693 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1194 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:51,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 964 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1134 Invalid, 0 Unknown, 1194 Unchecked, 1.7s Time] [2024-10-14 19:01:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2024-10-14 19:01:51,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1370. [2024-10-14 19:01:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 944 states have (on average 1.9915254237288136) internal successors, (1880), 1334 states have internal predecessors, (1880), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-14 19:01:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1941 transitions. [2024-10-14 19:01:51,707 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1941 transitions. Word has length 64 [2024-10-14 19:01:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1941 transitions. [2024-10-14 19:01:51,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 19:01:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1941 transitions. [2024-10-14 19:01:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 19:01:51,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:51,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:51,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-14 19:01:51,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:51,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:51,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1853468853, now seen corresponding path program 1 times [2024-10-14 19:01:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065041803] [2024-10-14 19:01:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:51,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:51,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:51,910 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:51,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 19:01:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:52,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 19:01:52,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:52,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-14 19:01:52,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:01:52,664 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-10-14 19:01:52,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:01:52,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:01:52,692 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:01:52,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:01:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:52,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:52,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065041803] [2024-10-14 19:01:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065041803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:01:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51471158] [2024-10-14 19:01:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:52,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:01:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:52,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:01:52,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-14 19:01:52,706 INFO L87 Difference]: Start difference. First operand 1370 states and 1941 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 19:01:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:56,297 INFO L93 Difference]: Finished difference Result 2329 states and 3258 transitions. [2024-10-14 19:01:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:01:56,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2024-10-14 19:01:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:56,301 INFO L225 Difference]: With dead ends: 2329 [2024-10-14 19:01:56,301 INFO L226 Difference]: Without dead ends: 2329 [2024-10-14 19:01:56,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-14 19:01:56,302 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 852 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1628 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:56,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1665 Invalid, 4286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2635 Invalid, 0 Unknown, 1628 Unchecked, 3.5s Time] [2024-10-14 19:01:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2024-10-14 19:01:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1362. [2024-10-14 19:01:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 944 states have (on average 1.9745762711864407) internal successors, (1864), 1326 states have internal predecessors, (1864), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-14 19:01:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1925 transitions. [2024-10-14 19:01:56,318 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1925 transitions. Word has length 64 [2024-10-14 19:01:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:56,318 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1925 transitions. [2024-10-14 19:01:56,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 19:01:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1925 transitions. [2024-10-14 19:01:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 19:01:56,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:56,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:56,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-14 19:01:56,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:56,520 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:56,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:56,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1865756806, now seen corresponding path program 1 times [2024-10-14 19:01:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:56,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391523782] [2024-10-14 19:01:56,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:56,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:56,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:56,522 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:56,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 19:01:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:56,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 19:01:56,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:56,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:01:56,787 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 19 treesize of output 1 [2024-10-14 19:01:56,802 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 23 treesize of output 11 [2024-10-14 19:01:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:56,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:56,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:56,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391523782] [2024-10-14 19:01:56,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391523782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:56,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:56,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:01:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268726560] [2024-10-14 19:01:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:56,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:01:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:56,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:01:56,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:01:56,827 INFO L87 Difference]: Start difference. First operand 1362 states and 1925 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:59,233 INFO L93 Difference]: Finished difference Result 1373 states and 1937 transitions. [2024-10-14 19:01:59,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:01:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2024-10-14 19:01:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:59,236 INFO L225 Difference]: With dead ends: 1373 [2024-10-14 19:01:59,236 INFO L226 Difference]: Without dead ends: 1373 [2024-10-14 19:01:59,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:01:59,237 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 12 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3264 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:59,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3264 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 19:01:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-14 19:01:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1372. [2024-10-14 19:01:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 952 states have (on average 1.9705882352941178) internal successors, (1876), 1334 states have internal predecessors, (1876), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-14 19:01:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1937 transitions. [2024-10-14 19:01:59,250 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1937 transitions. Word has length 70 [2024-10-14 19:01:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:59,250 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1937 transitions. [2024-10-14 19:01:59,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1937 transitions. [2024-10-14 19:01:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 19:01:59,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:59,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:59,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:59,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:59,452 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:01:59,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2003886214, now seen corresponding path program 1 times [2024-10-14 19:01:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:59,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914264344] [2024-10-14 19:01:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:59,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:59,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:59,454 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:59,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-14 19:01:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:59,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:01:59,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:59,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-14 19:01:59,739 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 13 treesize of output 9 [2024-10-14 19:01:59,748 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 19 treesize of output 1 [2024-10-14 19:01:59,773 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 21 treesize of output 9 [2024-10-14 19:01:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:59,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:59,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914264344] [2024-10-14 19:01:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914264344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:59,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:01:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767983420] [2024-10-14 19:01:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:59,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:01:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:01:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:01:59,838 INFO L87 Difference]: Start difference. First operand 1372 states and 1937 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 19:02:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:02:03,107 INFO L93 Difference]: Finished difference Result 1372 states and 1935 transitions. [2024-10-14 19:02:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:02:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2024-10-14 19:02:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:02:03,109 INFO L225 Difference]: With dead ends: 1372 [2024-10-14 19:02:03,110 INFO L226 Difference]: Without dead ends: 1372 [2024-10-14 19:02:03,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:02:03,110 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 11 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3832 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:02:03,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3832 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 19:02:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-10-14 19:02:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2024-10-14 19:02:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 952 states have (on average 1.968487394957983) internal successors, (1874), 1334 states have internal predecessors, (1874), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-14 19:02:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1935 transitions. [2024-10-14 19:02:03,123 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1935 transitions. Word has length 71 [2024-10-14 19:02:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:02:03,124 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1935 transitions. [2024-10-14 19:02:03,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 19:02:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1935 transitions. [2024-10-14 19:02:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 19:02:03,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:02:03,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:02:03,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-14 19:02:03,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:03,325 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:02:03,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:02:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash 894311914, now seen corresponding path program 1 times [2024-10-14 19:02:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:02:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872916063] [2024-10-14 19:02:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:02:03,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:03,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:02:03,329 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:02:03,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-14 19:02:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:02:03,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:02:03,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:02:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:03,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:02:03,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:02:03,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872916063] [2024-10-14 19:02:03,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872916063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:02:03,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:02:03,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:02:03,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150037988] [2024-10-14 19:02:03,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:02:03,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:02:03,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:02:03,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:02:03,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:02:03,628 INFO L87 Difference]: Start difference. First operand 1372 states and 1935 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 19:02:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:02:04,193 INFO L93 Difference]: Finished difference Result 1380 states and 1945 transitions. [2024-10-14 19:02:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:02:04,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2024-10-14 19:02:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:02:04,198 INFO L225 Difference]: With dead ends: 1380 [2024-10-14 19:02:04,198 INFO L226 Difference]: Without dead ends: 1378 [2024-10-14 19:02:04,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:02:04,199 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 3 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:02:04,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2215 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:02:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-10-14 19:02:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2024-10-14 19:02:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 956 states have (on average 1.9665271966527196) internal successors, (1880), 1340 states have internal predecessors, (1880), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-10-14 19:02:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1943 transitions. [2024-10-14 19:02:04,222 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1943 transitions. Word has length 76 [2024-10-14 19:02:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:02:04,222 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1943 transitions. [2024-10-14 19:02:04,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 19:02:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1943 transitions. [2024-10-14 19:02:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 19:02:04,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:02:04,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:02:04,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-14 19:02:04,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:04,424 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:02:04,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:02:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash 886648934, now seen corresponding path program 1 times [2024-10-14 19:02:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:02:04,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709265713] [2024-10-14 19:02:04,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:02:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:02:04,428 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:02:04,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-14 19:02:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:02:04,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:02:04,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:02:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:04,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:02:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:04,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:02:04,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709265713] [2024-10-14 19:02:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709265713] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:02:04,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:02:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-14 19:02:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128607552] [2024-10-14 19:02:04,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:02:04,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:02:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:02:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:02:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:02:04,835 INFO L87 Difference]: Start difference. First operand 1378 states and 1943 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 19:02:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:02:06,126 INFO L93 Difference]: Finished difference Result 1392 states and 1961 transitions. [2024-10-14 19:02:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 19:02:06,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2024-10-14 19:02:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:02:06,130 INFO L225 Difference]: With dead ends: 1392 [2024-10-14 19:02:06,130 INFO L226 Difference]: Without dead ends: 1388 [2024-10-14 19:02:06,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-14 19:02:06,131 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 13 mSDsluCounter, 4414 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5155 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:02:06,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5155 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:02:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-14 19:02:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1386. [2024-10-14 19:02:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 964 states have (on average 1.9605809128630705) internal successors, (1890), 1348 states have internal predecessors, (1890), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-10-14 19:02:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1953 transitions. [2024-10-14 19:02:06,159 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1953 transitions. Word has length 77 [2024-10-14 19:02:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:02:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1953 transitions. [2024-10-14 19:02:06,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 19:02:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1953 transitions. [2024-10-14 19:02:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 19:02:06,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:02:06,160 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:02:06,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-14 19:02:06,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:06,361 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:02:06,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:02:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1220336874, now seen corresponding path program 2 times [2024-10-14 19:02:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:02:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279481656] [2024-10-14 19:02:06,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:02:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:06,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:02:06,363 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:02:06,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-14 19:02:06,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:02:06,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:02:06,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:02:06,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:02:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:06,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:02:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:07,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:02:07,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279481656] [2024-10-14 19:02:07,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279481656] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:02:07,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:02:07,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-14 19:02:07,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235769058] [2024-10-14 19:02:07,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:02:07,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 19:02:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:02:07,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 19:02:07,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-14 19:02:07,147 INFO L87 Difference]: Start difference. First operand 1386 states and 1953 transitions. Second operand has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 19:02:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:02:09,201 INFO L93 Difference]: Finished difference Result 1410 states and 1991 transitions. [2024-10-14 19:02:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 19:02:09,202 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 80 [2024-10-14 19:02:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:02:09,204 INFO L225 Difference]: With dead ends: 1410 [2024-10-14 19:02:09,204 INFO L226 Difference]: Without dead ends: 1406 [2024-10-14 19:02:09,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-10-14 19:02:09,205 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 32 mSDsluCounter, 5890 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6631 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:02:09,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6631 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:02:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-14 19:02:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1404. [2024-10-14 19:02:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 982 states have (on average 1.9490835030549898) internal successors, (1914), 1366 states have internal predecessors, (1914), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-10-14 19:02:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1977 transitions. [2024-10-14 19:02:09,216 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1977 transitions. Word has length 80 [2024-10-14 19:02:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:02:09,216 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1977 transitions. [2024-10-14 19:02:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 19:02:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1977 transitions. [2024-10-14 19:02:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 19:02:09,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:02:09,217 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:02:09,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-14 19:02:09,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:09,417 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:02:09,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:02:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash 680455018, now seen corresponding path program 3 times [2024-10-14 19:02:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:02:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305059668] [2024-10-14 19:02:09,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:02:09,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:09,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:02:09,419 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:02:09,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-14 19:02:10,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:02:10,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:02:10,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 19:02:10,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:02:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:10,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:02:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:10,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:02:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305059668] [2024-10-14 19:02:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305059668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:02:10,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:02:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-10-14 19:02:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960323145] [2024-10-14 19:02:10,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:02:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 19:02:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:02:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 19:02:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-10-14 19:02:10,920 INFO L87 Difference]: Start difference. First operand 1404 states and 1977 transitions. Second operand has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 19:02:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:02:16,440 INFO L93 Difference]: Finished difference Result 1446 states and 2049 transitions. [2024-10-14 19:02:16,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-14 19:02:16,440 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 86 [2024-10-14 19:02:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:02:16,456 INFO L225 Difference]: With dead ends: 1446 [2024-10-14 19:02:16,456 INFO L226 Difference]: Without dead ends: 1440 [2024-10-14 19:02:16,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-10-14 19:02:16,457 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 65 mSDsluCounter, 11047 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 11788 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:02:16,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 11788 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 19:02:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-10-14 19:02:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2024-10-14 19:02:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1018 states have (on average 1.925343811394892) internal successors, (1960), 1402 states have internal predecessors, (1960), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-10-14 19:02:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2023 transitions. [2024-10-14 19:02:16,468 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2023 transitions. Word has length 86 [2024-10-14 19:02:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:02:16,468 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2023 transitions. [2024-10-14 19:02:16,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 19:02:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2023 transitions. [2024-10-14 19:02:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 19:02:16,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:02:16,469 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:02:16,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-10-14 19:02:16,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:16,669 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:02:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:02:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1913886614, now seen corresponding path program 4 times [2024-10-14 19:02:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:02:16,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182135117] [2024-10-14 19:02:16,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:02:16,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:16,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:02:16,673 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:02:16,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-14 19:02:17,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:02:17,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:02:17,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 19:02:17,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:02:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:17,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:02:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:02:18,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:02:18,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182135117] [2024-10-14 19:02:18,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182135117] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:02:18,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:02:18,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 19:02:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788427578] [2024-10-14 19:02:18,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:02:18,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 19:02:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:02:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 19:02:18,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 19:02:18,981 INFO L87 Difference]: Start difference. First operand 1440 states and 2023 transitions. Second operand has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 19:02:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:02:32,370 INFO L93 Difference]: Finished difference Result 1514 states and 2161 transitions. [2024-10-14 19:02:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-14 19:02:32,372 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2024-10-14 19:02:32,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:02:32,374 INFO L225 Difference]: With dead ends: 1514 [2024-10-14 19:02:32,374 INFO L226 Difference]: Without dead ends: 1510 [2024-10-14 19:02:32,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-10-14 19:02:32,376 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 102 mSDsluCounter, 17687 mSDsCounter, 0 mSdLazyCounter, 4165 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 18428 SdHoareTripleChecker+Invalid, 4218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:02:32,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 18428 Invalid, 4218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4165 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-14 19:02:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-10-14 19:02:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2024-10-14 19:02:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1086 states have (on average 1.8895027624309393) internal successors, (2052), 1470 states have internal predecessors, (2052), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-10-14 19:02:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2115 transitions. [2024-10-14 19:02:32,390 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2115 transitions. Word has length 98 [2024-10-14 19:02:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:02:32,391 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 2115 transitions. [2024-10-14 19:02:32,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 19:02:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2115 transitions. [2024-10-14 19:02:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 19:02:32,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:02:32,392 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:02:32,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-14 19:02:32,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:32,593 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-10-14 19:02:32,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:02:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -349973782, now seen corresponding path program 5 times [2024-10-14 19:02:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:02:32,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742108107] [2024-10-14 19:02:32,594 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:02:32,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:02:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:02:32,595 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:02:32,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-14 19:02:33,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:02:33,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:02:33,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-14 19:02:33,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:02:33,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:02:33,953 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:02:33,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-14 19:02:33,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:02:34,062 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 24 treesize of output 12 [2024-10-14 19:02:35,054 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:02:35,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-14 19:02:35,092 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 33 treesize of output 15 [2024-10-14 19:02:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2024-10-14 19:02:35,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:02:35,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:02:35,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742108107] [2024-10-14 19:02:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742108107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:02:35,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [398035954] [2024-10-14 19:02:35,485 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:02:35,485 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:02:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:02:35,487 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:02:35,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-10-14 19:02:35,992 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:02:35,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:02:36,048 WARN L253 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 670 conjuncts are in the unsatisfiable core [2024-10-14 19:02:36,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:02:36,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-14 19:02:36,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-10-14 19:02:36,113 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 7 treesize of output 6 [2024-10-14 19:02:36,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:36,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:36,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:36,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:02:36,357 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:02:36,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:02:36,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-14 19:02:36,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:36,704 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:36,704 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:36,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:02:36,740 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 8 treesize of output 1 [2024-10-14 19:02:36,758 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 8 treesize of output 1 [2024-10-14 19:02:37,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:02:37,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:37,255 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:37,255 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:02:37,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205