./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_JEN_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:10:55,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:10:55,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:10:55,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:10:55,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:10:55,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:10:55,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:10:55,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:10:55,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:10:55,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:10:55,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:10:55,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:10:55,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:10:55,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:10:55,795 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:10:55,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:10:55,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:10:55,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:10:55,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:10:55,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:10:55,797 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:10:55,805 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:10:55,805 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:10:55,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:10:55,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:10:55,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:10:55,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:10:55,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:10:55,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:10:55,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:10:55,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:10:55,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:10:55,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:10:55,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:10:55,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:10:55,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:10:55,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:10:55,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:10:55,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:10:55,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:10:55,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:10:55,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:10:55,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-10-11 19:10:56,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:10:56,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:10:56,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:10:56,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:10:56,062 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:10:56,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-11 19:10:57,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:10:57,893 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:10:57,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-11 19:10:57,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0b8b75e35/f8d09ce8a8014c81899ac9e2d8c71065/FLAGc24141450 [2024-10-11 19:10:57,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0b8b75e35/f8d09ce8a8014c81899ac9e2d8c71065 [2024-10-11 19:10:57,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:10:57,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:10:57,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:10:57,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:10:57,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:10:57,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:10:57" (1/1) ... [2024-10-11 19:10:57,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da1bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:57, skipping insertion in model container [2024-10-11 19:10:57,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:10:57" (1/1) ... [2024-10-11 19:10:58,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:10:58,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:10:58,634 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:10:58,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@33e7f449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:58, skipping insertion in model container [2024-10-11 19:10:58,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:10:58,635 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:10:58,637 INFO L158 Benchmark]: Toolchain (without parser) took 694.28ms. Allocated memory is still 190.8MB. Free memory was 115.2MB in the beginning and 152.5MB in the end (delta: -37.3MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-10-11 19:10:58,638 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 190.8MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:10:58,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 690.07ms. Allocated memory is still 190.8MB. Free memory was 115.0MB in the beginning and 152.5MB in the end (delta: -37.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-10-11 19:10:58,640 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.18ms. Allocated memory is still 190.8MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 690.07ms. Allocated memory is still 190.8MB. Free memory was 115.0MB in the beginning and 152.5MB in the end (delta: -37.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:11:00,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:11:00,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:11:00,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:11:00,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:11:00,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:11:00,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:11:00,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:11:00,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:11:00,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:11:00,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:11:00,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:11:00,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:11:00,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:11:00,778 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:11:00,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:11:00,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:11:00,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:11:00,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:11:00,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:11:00,779 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:11:00,781 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:11:00,781 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:11:00,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:11:00,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:11:00,782 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:11:00,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:11:00,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:11:00,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:11:00,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:11:00,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:11:00,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:11:00,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:11:00,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:11:00,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:11:00,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:11:00,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:11:00,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:11:00,787 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:11:00,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:11:00,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:11:00,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:11:00,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:11:00,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:11:00,789 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:11:00,789 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-10-11 19:11:01,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:11:01,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:11:01,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:11:01,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:11:01,139 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:11:01,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-11 19:11:02,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:11:03,147 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:11:03,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-11 19:11:03,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d942db06/9df71bf578ce47d5b58d27ced9b2b89c/FLAGbd0ca5dfb [2024-10-11 19:11:03,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d942db06/9df71bf578ce47d5b58d27ced9b2b89c [2024-10-11 19:11:03,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:11:03,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:11:03,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:11:03,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:11:03,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:11:03,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:11:03" (1/1) ... [2024-10-11 19:11:03,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cc9760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:03, skipping insertion in model container [2024-10-11 19:11:03,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:11:03" (1/1) ... [2024-10-11 19:11:03,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:11:03,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:11:03,971 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:11:03,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:11:04,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:11:04,110 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:11:04,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:11:04,265 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:11:04,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04 WrapperNode [2024-10-11 19:11:04,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:11:04,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:11:04,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:11:04,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:11:04,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,389 INFO L138 Inliner]: procedures = 285, calls = 290, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1069 [2024-10-11 19:11:04,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:11:04,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:11:04,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:11:04,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:11:04,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,496 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 220, 3, 34]. 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, 49, 2, 4]. [2024-10-11 19:11:04,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:11:04,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:11:04,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:11:04,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:11:04,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (1/1) ... [2024-10-11 19:11:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:11:04,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:11:04,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:11:04,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:11:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 19:11:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 19:11:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:11:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:11:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:11:04,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 19:11:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:11:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:11:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:11:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 19:11:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:11:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:11:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:11:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:11:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:11:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 19:11:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-11 19:11:04,691 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-11 19:11:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:11:04,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:11:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:11:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:11:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-11 19:11:04,691 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-11 19:11:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:11:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:11:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:11:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 19:11:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-11 19:11:04,692 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-11 19:11:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:11:04,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:11:04,947 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:11:04,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:11:08,598 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-10-11 19:11:08,599 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:11:08,760 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:11:08,760 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 19:11:08,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:11:08 BoogieIcfgContainer [2024-10-11 19:11:08,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:11:08,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:11:08,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:11:08,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:11:08,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:11:03" (1/3) ... [2024-10-11 19:11:08,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1ed05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:11:08, skipping insertion in model container [2024-10-11 19:11:08,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:04" (2/3) ... [2024-10-11 19:11:08,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1ed05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:11:08, skipping insertion in model container [2024-10-11 19:11:08,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:11:08" (3/3) ... [2024-10-11 19:11:08,768 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2024-10-11 19:11:08,786 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:11:08,787 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 522 error locations. [2024-10-11 19:11:08,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:11:08,895 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;@73363ec5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:11:08,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2024-10-11 19:11:08,903 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-11 19:11:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:11:08,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:08,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:11:08,910 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-11 19:11:08,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash 55116, now seen corresponding path program 1 times [2024-10-11 19:11:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448720253] [2024-10-11 19:11:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:08,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:08,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:08,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:08,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:11:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:09,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:11:09,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:09,181 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-11 19:11:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:09,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:09,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:09,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448720253] [2024-10-11 19:11:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448720253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:09,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:11:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487423326] [2024-10-11 19:11:09,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:09,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:11:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:09,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:11:09,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:11:09,254 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-11 19:11:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:10,850 INFO L93 Difference]: Finished difference Result 1048 states and 1118 transitions. [2024-10-11 19:11:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:11:10,853 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-11 19:11:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:10,876 INFO L225 Difference]: With dead ends: 1048 [2024-10-11 19:11:10,877 INFO L226 Difference]: Without dead ends: 1047 [2024-10-11 19:11:10,878 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-11 19:11:10,883 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 649 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:10,885 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.5s Time] [2024-10-11 19:11:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-10-11 19:11:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 990. [2024-10-11 19:11:10,986 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-11 19:11:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1099 transitions. [2024-10-11 19:11:10,993 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1099 transitions. Word has length 2 [2024-10-11 19:11:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:10,994 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1099 transitions. [2024-10-11 19:11:10,994 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-11 19:11:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1099 transitions. [2024-10-11 19:11:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:11:10,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:10,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:11:11,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:11,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:11,197 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-11 19:11:11,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 55117, now seen corresponding path program 1 times [2024-10-11 19:11:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472625219] [2024-10-11 19:11:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:11,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:11,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:11,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:11,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:11:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:11,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:11:11,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:11,342 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-11 19:11:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:11,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:11,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472625219] [2024-10-11 19:11:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472625219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:11,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:11:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432681880] [2024-10-11 19:11:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:11,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:11:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:11:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:11:11,358 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-11 19:11:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:13,506 INFO L93 Difference]: Finished difference Result 1355 states and 1501 transitions. [2024-10-11 19:11:13,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:11:13,506 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-11 19:11:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:13,511 INFO L225 Difference]: With dead ends: 1355 [2024-10-11 19:11:13,511 INFO L226 Difference]: Without dead ends: 1355 [2024-10-11 19:11:13,513 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-11 19:11:13,514 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 389 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:13,514 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.1s Time] [2024-10-11 19:11:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-10-11 19:11:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1164. [2024-10-11 19:11:13,547 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-11 19:11:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1489 transitions. [2024-10-11 19:11:13,554 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1489 transitions. Word has length 2 [2024-10-11 19:11:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:13,555 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1489 transitions. [2024-10-11 19:11:13,555 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-11 19:11:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1489 transitions. [2024-10-11 19:11:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:11:13,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:13,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:11:13,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:11:13,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:13,757 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-11 19:11:13,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:13,757 INFO L85 PathProgramCache]: Analyzing trace with hash -636050060, now seen corresponding path program 1 times [2024-10-11 19:11:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:13,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734101685] [2024-10-11 19:11:13,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:13,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-11 19:11:13,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:13,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:13,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:11:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:13,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:11:13,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:13,905 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-11 19:11:13,911 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-11 19:11:13,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:11:13,986 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-11 19:11:14,009 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:11:14,010 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-11 19:11:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:14,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:14,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734101685] [2024-10-11 19:11:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734101685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:14,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:14,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:11:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901334472] [2024-10-11 19:11:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:14,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:11:14,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:14,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:11:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:11:14,040 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-11 19:11:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:17,527 INFO L93 Difference]: Finished difference Result 1798 states and 2181 transitions. [2024-10-11 19:11:17,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:11:17,527 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-11 19:11:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:17,533 INFO L225 Difference]: With dead ends: 1798 [2024-10-11 19:11:17,533 INFO L226 Difference]: Without dead ends: 1798 [2024-10-11 19:11:17,534 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-11 19:11:17,535 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 662 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:17,535 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.4s Time] [2024-10-11 19:11:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-10-11 19:11:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1280. [2024-10-11 19:11:17,558 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-11 19:11:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1743 transitions. [2024-10-11 19:11:17,563 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1743 transitions. Word has length 6 [2024-10-11 19:11:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:17,563 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1743 transitions. [2024-10-11 19:11:17,564 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-11 19:11:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1743 transitions. [2024-10-11 19:11:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:11:17,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:17,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:11:17,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:11:17,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:17,765 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-11 19:11:17,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1757284643, now seen corresponding path program 1 times [2024-10-11 19:11:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:17,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865030142] [2024-10-11 19:11:17,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:17,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:17,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:17,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:17,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:11:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:17,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:11:17,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:17,912 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-11 19:11:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:17,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:17,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:17,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865030142] [2024-10-11 19:11:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865030142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:17,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:11:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605406349] [2024-10-11 19:11:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:17,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:11:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:11:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:11:17,927 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-11 19:11:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:19,760 INFO L93 Difference]: Finished difference Result 1754 states and 2445 transitions. [2024-10-11 19:11:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:11:19,760 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-11 19:11:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:19,766 INFO L225 Difference]: With dead ends: 1754 [2024-10-11 19:11:19,767 INFO L226 Difference]: Without dead ends: 1754 [2024-10-11 19:11:19,767 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-11 19:11:19,769 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 830 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:19,769 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.8s Time] [2024-10-11 19:11:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2024-10-11 19:11:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1235. [2024-10-11 19:11:19,791 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-11 19:11:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1684 transitions. [2024-10-11 19:11:19,795 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1684 transitions. Word has length 7 [2024-10-11 19:11:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:19,796 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1684 transitions. [2024-10-11 19:11:19,796 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-11 19:11:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1684 transitions. [2024-10-11 19:11:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:11:19,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:19,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:11:19,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:11:19,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:19,998 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-11 19:11:19,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1757284644, now seen corresponding path program 1 times [2024-10-11 19:11:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622490115] [2024-10-11 19:11:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:19,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:19,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:20,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:20,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:11:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:20,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:11:20,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:20,133 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-11 19:11:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:20,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:20,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:20,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622490115] [2024-10-11 19:11:20,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622490115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:20,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:20,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:11:20,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569184267] [2024-10-11 19:11:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:20,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:11:20,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:20,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:11:20,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:11:20,155 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-11 19:11:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:21,910 INFO L93 Difference]: Finished difference Result 1809 states and 2458 transitions. [2024-10-11 19:11:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:11:21,910 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-11 19:11:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:21,916 INFO L225 Difference]: With dead ends: 1809 [2024-10-11 19:11:21,916 INFO L226 Difference]: Without dead ends: 1809 [2024-10-11 19:11:21,916 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-11 19:11:21,919 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:21,919 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.7s Time] [2024-10-11 19:11:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-10-11 19:11:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1227. [2024-10-11 19:11:21,947 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-11 19:11:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1662 transitions. [2024-10-11 19:11:21,951 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1662 transitions. Word has length 7 [2024-10-11 19:11:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:21,951 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1662 transitions. [2024-10-11 19:11:21,952 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-11 19:11:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1662 transitions. [2024-10-11 19:11:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:11:21,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:21,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:11:21,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:22,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:22,153 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-11 19:11:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2143508545, now seen corresponding path program 1 times [2024-10-11 19:11:22,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:22,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869462345] [2024-10-11 19:11:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:22,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:22,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:22,156 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:22,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:11:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:22,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:11:22,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:22,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:22,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:22,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869462345] [2024-10-11 19:11:22,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869462345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:22,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:22,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:11:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737135891] [2024-10-11 19:11:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:22,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:11:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:22,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:11:22,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:11:22,360 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-11 19:11:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:23,498 INFO L93 Difference]: Finished difference Result 1627 states and 2172 transitions. [2024-10-11 19:11:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:11:23,499 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-11 19:11:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:23,504 INFO L225 Difference]: With dead ends: 1627 [2024-10-11 19:11:23,504 INFO L226 Difference]: Without dead ends: 1627 [2024-10-11 19:11:23,505 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-11 19:11:23,505 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 406 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-11 19:11:23,506 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-11 19:11:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-10-11 19:11:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1437. [2024-10-11 19:11:23,527 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-11 19:11:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2129 transitions. [2024-10-11 19:11:23,532 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2129 transitions. Word has length 12 [2024-10-11 19:11:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:23,533 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2129 transitions. [2024-10-11 19:11:23,533 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-11 19:11:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2129 transitions. [2024-10-11 19:11:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:11:23,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:23,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:11:23,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:23,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:23,735 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-11 19:11:23,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1554900703, now seen corresponding path program 1 times [2024-10-11 19:11:23,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:23,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106704532] [2024-10-11 19:11:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:23,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:23,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:23,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:11:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:23,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:11:23,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:23,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:23,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:23,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106704532] [2024-10-11 19:11:23,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106704532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:23,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:23,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:11:23,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379012266] [2024-10-11 19:11:23,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:23,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:11:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:23,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:11:23,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:11:23,897 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-11 19:11:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:24,382 INFO L93 Difference]: Finished difference Result 1353 states and 1969 transitions. [2024-10-11 19:11:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:11:24,383 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-11 19:11:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:24,387 INFO L225 Difference]: With dead ends: 1353 [2024-10-11 19:11:24,388 INFO L226 Difference]: Without dead ends: 1353 [2024-10-11 19:11:24,388 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-11 19:11:24,388 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-11 19:11:24,389 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-11 19:11:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-11 19:11:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-10-11 19:11:24,410 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-11 19:11:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1969 transitions. [2024-10-11 19:11:24,414 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1969 transitions. Word has length 12 [2024-10-11 19:11:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:24,415 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1969 transitions. [2024-10-11 19:11:24,415 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-11 19:11:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1969 transitions. [2024-10-11 19:11:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:11:24,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:24,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:11:24,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:11:24,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:24,617 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-11 19:11:24,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash 201952929, now seen corresponding path program 1 times [2024-10-11 19:11:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:24,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620696838] [2024-10-11 19:11:24,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:24,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:24,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:24,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:24,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:11:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:24,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:11:24,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:24,796 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:11:24,797 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:11:24,797 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:11:24,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-11 19:11:24,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:11:24,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-11 19:11:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:24,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:24,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:24,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620696838] [2024-10-11 19:11:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620696838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:11:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193379121] [2024-10-11 19:11:24,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:24,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:11:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:11:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:11:24,865 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-11 19:11:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:26,052 INFO L93 Difference]: Finished difference Result 1853 states and 2258 transitions. [2024-10-11 19:11:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:11:26,053 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-11 19:11:26,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:26,058 INFO L225 Difference]: With dead ends: 1853 [2024-10-11 19:11:26,058 INFO L226 Difference]: Without dead ends: 1853 [2024-10-11 19:11:26,058 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-11 19:11:26,059 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 809 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:26,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2678 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:11:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-10-11 19:11:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1082. [2024-10-11 19:11:26,074 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-11 19:11:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1376 transitions. [2024-10-11 19:11:26,078 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1376 transitions. Word has length 15 [2024-10-11 19:11:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:26,078 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1376 transitions. [2024-10-11 19:11:26,078 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-11 19:11:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1376 transitions. [2024-10-11 19:11:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:11:26,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:26,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:11:26,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:11:26,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:26,280 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-11 19:11:26,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1507469734, now seen corresponding path program 1 times [2024-10-11 19:11:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580301599] [2024-10-11 19:11:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:26,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:26,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:26,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:26,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:11:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:26,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:11:26,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:26,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:26,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580301599] [2024-10-11 19:11:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580301599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:26,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:11:26,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639448290] [2024-10-11 19:11:26,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:26,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:11:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:26,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:11:26,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:11:26,468 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-11 19:11:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:26,931 INFO L93 Difference]: Finished difference Result 1028 states and 1296 transitions. [2024-10-11 19:11:26,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:11:26,932 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-11 19:11:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:26,934 INFO L225 Difference]: With dead ends: 1028 [2024-10-11 19:11:26,935 INFO L226 Difference]: Without dead ends: 1028 [2024-10-11 19:11:26,935 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-11 19:11:26,935 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:26,935 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.5s Time] [2024-10-11 19:11:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2024-10-11 19:11:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2024-10-11 19:11:26,949 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-11 19:11:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1296 transitions. [2024-10-11 19:11:26,952 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1296 transitions. Word has length 15 [2024-10-11 19:11:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:26,952 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1296 transitions. [2024-10-11 19:11:26,953 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-11 19:11:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1296 transitions. [2024-10-11 19:11:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:11:26,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:26,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:11:26,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:11:27,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:27,158 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-11 19:11:27,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1274437676, now seen corresponding path program 1 times [2024-10-11 19:11:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:27,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567390414] [2024-10-11 19:11:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:27,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:27,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:27,160 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:27,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:11:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:27,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:11:27,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:27,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-11 19:11:27,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:27,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:27,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567390414] [2024-10-11 19:11:27,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567390414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:27,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:27,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:11:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155358818] [2024-10-11 19:11:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:27,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:11:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:27,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:11:27,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:11:27,364 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-11 19:11:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:27,920 INFO L93 Difference]: Finished difference Result 1012 states and 1252 transitions. [2024-10-11 19:11:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:11:27,921 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-11 19:11:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:27,924 INFO L225 Difference]: With dead ends: 1012 [2024-10-11 19:11:27,924 INFO L226 Difference]: Without dead ends: 1012 [2024-10-11 19:11:27,924 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-11 19:11:27,925 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:27,925 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.5s Time] [2024-10-11 19:11:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-10-11 19:11:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2024-10-11 19:11:27,937 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-11 19:11:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1252 transitions. [2024-10-11 19:11:27,939 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1252 transitions. Word has length 17 [2024-10-11 19:11:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1252 transitions. [2024-10-11 19:11:27,940 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-11 19:11:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1252 transitions. [2024-10-11 19:11:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:11:27,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:27,940 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-11 19:11:27,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:28,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:28,145 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-11 19:11:28,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1196089309, now seen corresponding path program 1 times [2024-10-11 19:11:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105518898] [2024-10-11 19:11:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:28,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:28,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:28,148 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:28,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:11:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:28,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:11:28,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:28,321 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-11 19:11:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:28,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:28,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:28,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105518898] [2024-10-11 19:11:28,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105518898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:28,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:11:28,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199752030] [2024-10-11 19:11:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:28,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:11:28,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:11:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:11:28,500 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-11 19:11:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:30,567 INFO L93 Difference]: Finished difference Result 1498 states and 1865 transitions. [2024-10-11 19:11:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:11:30,568 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-11 19:11:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:30,571 INFO L225 Difference]: With dead ends: 1498 [2024-10-11 19:11:30,571 INFO L226 Difference]: Without dead ends: 1498 [2024-10-11 19:11:30,571 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-11 19:11:30,572 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 535 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:30,572 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.0s Time] [2024-10-11 19:11:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-11 19:11:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1008. [2024-10-11 19:11:30,584 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-11 19:11:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1244 transitions. [2024-10-11 19:11:30,587 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1244 transitions. Word has length 31 [2024-10-11 19:11:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:30,587 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1244 transitions. [2024-10-11 19:11:30,587 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-11 19:11:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1244 transitions. [2024-10-11 19:11:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:11:30,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:30,589 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-11 19:11:30,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:11:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:30,790 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-11 19:11:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1196089310, now seen corresponding path program 1 times [2024-10-11 19:11:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:30,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118089145] [2024-10-11 19:11:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:30,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:30,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:30,795 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:30,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:11:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:30,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:11:30,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:30,960 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-11 19:11:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:31,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:31,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:31,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118089145] [2024-10-11 19:11:31,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118089145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:31,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:31,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:11:31,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229094232] [2024-10-11 19:11:31,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:11:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:11:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:11:31,025 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-11 19:11:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:32,394 INFO L93 Difference]: Finished difference Result 1387 states and 1744 transitions. [2024-10-11 19:11:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:11:32,395 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-11 19:11:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:32,399 INFO L225 Difference]: With dead ends: 1387 [2024-10-11 19:11:32,399 INFO L226 Difference]: Without dead ends: 1387 [2024-10-11 19:11:32,399 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-11 19:11:32,400 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 728 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:32,400 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.3s Time] [2024-10-11 19:11:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-10-11 19:11:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1004. [2024-10-11 19:11:32,412 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-11 19:11:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1236 transitions. [2024-10-11 19:11:32,414 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1236 transitions. Word has length 31 [2024-10-11 19:11:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:32,415 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1236 transitions. [2024-10-11 19:11:32,415 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-11 19:11:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1236 transitions. [2024-10-11 19:11:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 19:11:32,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:32,416 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-11 19:11:32,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:11:32,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:32,617 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-11 19:11:32,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1418610896, now seen corresponding path program 1 times [2024-10-11 19:11:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:32,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649355304] [2024-10-11 19:11:32,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:32,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:32,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:32,619 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:32,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:11:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:32,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:11:32,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:32,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:32,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:32,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649355304] [2024-10-11 19:11:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649355304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:32,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:11:32,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343681424] [2024-10-11 19:11:32,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:11:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:32,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:11:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:11:32,887 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-11 19:11:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:33,588 INFO L93 Difference]: Finished difference Result 992 states and 1216 transitions. [2024-10-11 19:11:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:11:33,589 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-11 19:11:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:33,591 INFO L225 Difference]: With dead ends: 992 [2024-10-11 19:11:33,591 INFO L226 Difference]: Without dead ends: 992 [2024-10-11 19:11:33,591 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-11 19:11:33,592 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 15 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:33,592 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.7s Time] [2024-10-11 19:11:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-10-11 19:11:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2024-10-11 19:11:33,603 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-11 19:11:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1216 transitions. [2024-10-11 19:11:33,605 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1216 transitions. Word has length 51 [2024-10-11 19:11:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:33,606 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1216 transitions. [2024-10-11 19:11:33,606 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-11 19:11:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1216 transitions. [2024-10-11 19:11:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:11:33,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:33,609 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-11 19:11:33,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:33,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:33,814 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-11 19:11:33,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:33,815 INFO L85 PathProgramCache]: Analyzing trace with hash -711112527, now seen corresponding path program 1 times [2024-10-11 19:11:33,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:33,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715209904] [2024-10-11 19:11:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:33,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:33,819 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:33,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:11:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:34,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:11:34,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:34,177 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-11 19:11:34,177 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-11 19:11:34,248 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 19:11:34,248 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-11 19:11:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:34,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:34,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715209904] [2024-10-11 19:11:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715209904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:11:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531073113] [2024-10-11 19:11:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:34,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:11:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:11:34,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:11:34,796 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-11 19:11:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:36,857 INFO L93 Difference]: Finished difference Result 1810 states and 2219 transitions. [2024-10-11 19:11:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:11:36,857 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-11 19:11:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:36,862 INFO L225 Difference]: With dead ends: 1810 [2024-10-11 19:11:36,862 INFO L226 Difference]: Without dead ends: 1810 [2024-10-11 19:11:36,862 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-11 19:11:36,863 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 715 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:36,863 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.0s Time] [2024-10-11 19:11:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-11 19:11:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1344. [2024-10-11 19:11:36,880 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-11 19:11:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1912 transitions. [2024-10-11 19:11:36,884 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1912 transitions. Word has length 55 [2024-10-11 19:11:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:36,884 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1912 transitions. [2024-10-11 19:11:36,884 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-11 19:11:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1912 transitions. [2024-10-11 19:11:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:11:36,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:36,885 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-11 19:11:36,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:37,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:37,087 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-11 19:11:37,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -711112526, now seen corresponding path program 1 times [2024-10-11 19:11:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:37,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137868028] [2024-10-11 19:11:37,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:37,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:37,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:37,091 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:37,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:11:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:37,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 19:11:37,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:37,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:11:37,422 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-11 19:11:37,488 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 19:11:37,489 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-11 19:11:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:38,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:38,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:38,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137868028] [2024-10-11 19:11:38,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137868028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:38,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:38,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:11:38,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710632304] [2024-10-11 19:11:38,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:38,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:11:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:38,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:11:38,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:11:38,003 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-11 19:11:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:39,577 INFO L93 Difference]: Finished difference Result 1349 states and 1918 transitions. [2024-10-11 19:11:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:11:39,578 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-11 19:11:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:39,582 INFO L225 Difference]: With dead ends: 1349 [2024-10-11 19:11:39,582 INFO L226 Difference]: Without dead ends: 1349 [2024-10-11 19:11:39,583 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-11 19:11:39,583 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 0 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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-11 19:11:39,583 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-11 19:11:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-10-11 19:11:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2024-10-11 19:11:39,599 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-11 19:11:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1918 transitions. [2024-10-11 19:11:39,602 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1918 transitions. Word has length 55 [2024-10-11 19:11:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:39,603 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1918 transitions. [2024-10-11 19:11:39,603 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-11 19:11:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1918 transitions. [2024-10-11 19:11:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 19:11:39,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:39,604 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-11 19:11:39,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 19:11:39,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:39,805 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-11 19:11:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:39,806 INFO L85 PathProgramCache]: Analyzing trace with hash 511752310, now seen corresponding path program 1 times [2024-10-11 19:11:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:39,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788878443] [2024-10-11 19:11:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:39,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:39,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:39,809 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:39,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:11:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:40,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:11:40,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:40,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:40,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788878443] [2024-10-11 19:11:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788878443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:11:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824969077] [2024-10-11 19:11:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:40,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:11:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:11:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:11:40,163 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-11 19:11:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:41,450 INFO L93 Difference]: Finished difference Result 1353 states and 1926 transitions. [2024-10-11 19:11:41,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:11:41,452 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-11 19:11:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:41,457 INFO L225 Difference]: With dead ends: 1353 [2024-10-11 19:11:41,457 INFO L226 Difference]: Without dead ends: 1353 [2024-10-11 19:11:41,458 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-11 19:11:41,458 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 19 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:41,459 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.2s Time] [2024-10-11 19:11:41,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-11 19:11:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1351. [2024-10-11 19:11:41,474 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-11 19:11:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1922 transitions. [2024-10-11 19:11:41,477 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1922 transitions. Word has length 59 [2024-10-11 19:11:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:41,478 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1922 transitions. [2024-10-11 19:11:41,478 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-11 19:11:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1922 transitions. [2024-10-11 19:11:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 19:11:41,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:41,479 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-11 19:11:41,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:11:41,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:41,679 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-11 19:11:41,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash -918850781, now seen corresponding path program 1 times [2024-10-11 19:11:41,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:41,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723406077] [2024-10-11 19:11:41,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:41,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:41,681 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:41,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:11:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:41,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:11:41,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:41,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:41,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:41,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723406077] [2024-10-11 19:11:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723406077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:41,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:41,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:11:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56859058] [2024-10-11 19:11:41,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:11:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:41,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:11:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:11:41,964 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-11 19:11:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:42,808 INFO L93 Difference]: Finished difference Result 1375 states and 1946 transitions. [2024-10-11 19:11:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:11:42,809 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-11 19:11:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:42,813 INFO L225 Difference]: With dead ends: 1375 [2024-10-11 19:11:42,814 INFO L226 Difference]: Without dead ends: 1375 [2024-10-11 19:11:42,814 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-11 19:11:42,814 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 13 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:42,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3743 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:11:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-10-11 19:11:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1371. [2024-10-11 19:11:42,830 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-11 19:11:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1943 transitions. [2024-10-11 19:11:42,833 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1943 transitions. Word has length 62 [2024-10-11 19:11:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:42,833 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1943 transitions. [2024-10-11 19:11:42,833 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-11 19:11:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1943 transitions. [2024-10-11 19:11:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:11:42,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:42,834 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-11 19:11:42,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 19:11:43,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:43,035 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-11 19:11:43,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1853468852, now seen corresponding path program 1 times [2024-10-11 19:11:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:43,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450892437] [2024-10-11 19:11:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:43,039 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:43,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:11:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:43,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:11:43,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:43,383 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-11 19:11:43,503 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-11 19:11:43,515 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 19:11:43,515 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-11 19:11:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:43,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:43,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:43,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450892437] [2024-10-11 19:11:43,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450892437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:43,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:11:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952707426] [2024-10-11 19:11:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:43,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:11:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:43,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:11:43,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-11 19:11:43,525 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-11 19:11:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:45,029 INFO L93 Difference]: Finished difference Result 1745 states and 2441 transitions. [2024-10-11 19:11:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:11:45,030 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-11 19:11:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:45,034 INFO L225 Difference]: With dead ends: 1745 [2024-10-11 19:11:45,034 INFO L226 Difference]: Without dead ends: 1745 [2024-10-11 19:11:45,035 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-11 19:11:45,035 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 693 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:45,035 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.5s Time] [2024-10-11 19:11:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2024-10-11 19:11:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1370. [2024-10-11 19:11:45,055 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-11 19:11:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1941 transitions. [2024-10-11 19:11:45,059 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1941 transitions. Word has length 64 [2024-10-11 19:11:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:45,060 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1941 transitions. [2024-10-11 19:11:45,060 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-11 19:11:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1941 transitions. [2024-10-11 19:11:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:11:45,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:45,061 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-11 19:11:45,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:45,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:45,262 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-11 19:11:45,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1853468853, now seen corresponding path program 1 times [2024-10-11 19:11:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:45,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171450200] [2024-10-11 19:11:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:45,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:45,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:45,264 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:45,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 19:11:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:45,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:11:45,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:45,711 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-11 19:11:45,717 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-11 19:11:46,118 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-11 19:11:46,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:11:46,132 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-11 19:11:46,145 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:11:46,146 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-11 19:11:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:46,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:46,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171450200] [2024-10-11 19:11:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171450200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:46,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:46,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:11:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131046036] [2024-10-11 19:11:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:46,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:11:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:11:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-11 19:11:46,162 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-11 19:11:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:49,766 INFO L93 Difference]: Finished difference Result 2329 states and 3258 transitions. [2024-10-11 19:11:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:11:49,766 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-11 19:11:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:49,775 INFO L225 Difference]: With dead ends: 2329 [2024-10-11 19:11:49,775 INFO L226 Difference]: Without dead ends: 2329 [2024-10-11 19:11:49,775 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-11 19:11:49,776 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-11 19:11:49,776 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-11 19:11:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2024-10-11 19:11:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1362. [2024-10-11 19:11:49,800 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-11 19:11:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1925 transitions. [2024-10-11 19:11:49,802 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1925 transitions. Word has length 64 [2024-10-11 19:11:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1925 transitions. [2024-10-11 19:11:49,803 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-11 19:11:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1925 transitions. [2024-10-11 19:11:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 19:11:49,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:49,804 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-11 19:11:49,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 19:11:50,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:50,005 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-11 19:11:50,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1865756806, now seen corresponding path program 1 times [2024-10-11 19:11:50,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:50,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077374199] [2024-10-11 19:11:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:50,009 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:50,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 19:11:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:50,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:11:50,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:50,287 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-11 19:11:50,302 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-11 19:11:50,321 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-11 19:11:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:50,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:50,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077374199] [2024-10-11 19:11:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077374199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:50,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:11:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516812056] [2024-10-11 19:11:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:50,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:11:50,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:11:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:11:50,351 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-11 19:11:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:52,804 INFO L93 Difference]: Finished difference Result 1373 states and 1937 transitions. [2024-10-11 19:11:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:11:52,805 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-11 19:11:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:52,808 INFO L225 Difference]: With dead ends: 1373 [2024-10-11 19:11:52,808 INFO L226 Difference]: Without dead ends: 1373 [2024-10-11 19:11:52,808 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-11 19:11:52,809 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 12 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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-11 19:11:52,809 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-11 19:11:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-11 19:11:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1372. [2024-10-11 19:11:52,824 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-11 19:11:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1937 transitions. [2024-10-11 19:11:52,827 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1937 transitions. Word has length 70 [2024-10-11 19:11:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1937 transitions. [2024-10-11 19:11:52,827 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-11 19:11:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1937 transitions. [2024-10-11 19:11:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 19:11:52,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:52,828 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-11 19:11:52,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-11 19:11:53,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:53,029 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-11 19:11:53,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2003886214, now seen corresponding path program 1 times [2024-10-11 19:11:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:53,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709680939] [2024-10-11 19:11:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:53,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:53,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:53,031 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:53,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 19:11:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:53,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 19:11:53,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:53,334 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-11 19:11:53,364 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-11 19:11:53,371 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-11 19:11:53,407 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-11 19:11:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:53,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:53,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709680939] [2024-10-11 19:11:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709680939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:11:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388341364] [2024-10-11 19:11:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:11:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:11:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:11:53,487 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-11 19:11:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:56,635 INFO L93 Difference]: Finished difference Result 1372 states and 1935 transitions. [2024-10-11 19:11:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:11:56,636 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-11 19:11:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:56,638 INFO L225 Difference]: With dead ends: 1372 [2024-10-11 19:11:56,638 INFO L226 Difference]: Without dead ends: 1372 [2024-10-11 19:11:56,638 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-11 19:11:56,639 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 11 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:11:56,639 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.1s Time] [2024-10-11 19:11:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-10-11 19:11:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2024-10-11 19:11:56,653 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-11 19:11:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1935 transitions. [2024-10-11 19:11:56,655 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1935 transitions. Word has length 71 [2024-10-11 19:11:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:56,656 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1935 transitions. [2024-10-11 19:11:56,656 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-11 19:11:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1935 transitions. [2024-10-11 19:11:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 19:11:56,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:56,657 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-11 19:11:56,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:56,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:56,858 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-11 19:11:56,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash 894311914, now seen corresponding path program 1 times [2024-10-11 19:11:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:56,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200214938] [2024-10-11 19:11:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:56,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:56,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:56,862 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:56,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 19:11:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:57,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:11:57,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:11:57,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:11:57,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:57,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200214938] [2024-10-11 19:11:57,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200214938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:11:57,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:11:57,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:11:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634186492] [2024-10-11 19:11:57,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:11:57,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:11:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:57,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:11:57,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:11:57,183 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-11 19:11:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:57,733 INFO L93 Difference]: Finished difference Result 1380 states and 1945 transitions. [2024-10-11 19:11:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:11:57,735 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-11 19:11:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:57,738 INFO L225 Difference]: With dead ends: 1380 [2024-10-11 19:11:57,738 INFO L226 Difference]: Without dead ends: 1378 [2024-10-11 19:11:57,739 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-11 19:11:57,739 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-11 19:11:57,740 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-11 19:11:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-10-11 19:11:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2024-10-11 19:11:57,753 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-11 19:11:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1943 transitions. [2024-10-11 19:11:57,756 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1943 transitions. Word has length 76 [2024-10-11 19:11:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:57,756 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1943 transitions. [2024-10-11 19:11:57,757 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-11 19:11:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1943 transitions. [2024-10-11 19:11:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 19:11:57,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:57,757 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-11 19:11:57,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-11 19:11:57,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:57,958 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-11 19:11:57,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash 886648934, now seen corresponding path program 1 times [2024-10-11 19:11:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:57,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108102073] [2024-10-11 19:11:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:11:57,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:57,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:57,963 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:57,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-11 19:11:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:11:58,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:11:58,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:11:58,310 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-11 19:11:58,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:11:58,435 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-11 19:11:58,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:11:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108102073] [2024-10-11 19:11:58,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108102073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:11:58,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:11:58,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-11 19:11:58,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852617276] [2024-10-11 19:11:58,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:11:58,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:11:58,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:11:58,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:11:58,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:11:58,439 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-11 19:11:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:11:59,732 INFO L93 Difference]: Finished difference Result 1392 states and 1961 transitions. [2024-10-11 19:11:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:11:59,734 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-11 19:11:59,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:11:59,736 INFO L225 Difference]: With dead ends: 1392 [2024-10-11 19:11:59,736 INFO L226 Difference]: Without dead ends: 1388 [2024-10-11 19:11:59,736 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-11 19:11:59,736 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-11 19:11:59,737 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-11 19:11:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-11 19:11:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1386. [2024-10-11 19:11:59,749 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-11 19:11:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1953 transitions. [2024-10-11 19:11:59,752 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1953 transitions. Word has length 77 [2024-10-11 19:11:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:11:59,752 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1953 transitions. [2024-10-11 19:11:59,752 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-11 19:11:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1953 transitions. [2024-10-11 19:11:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 19:11:59,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:11:59,753 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-11 19:11:59,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-10-11 19:11:59,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:59,954 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-11 19:11:59,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:11:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1220336874, now seen corresponding path program 2 times [2024-10-11 19:11:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:11:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026049799] [2024-10-11 19:11:59,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:11:59,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:11:59,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:11:59,959 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:11:59,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-11 19:12:00,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:12:00,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:12:00,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:12:00,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:00,526 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-11 19:12:00,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:12:00,698 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-11 19:12:00,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:00,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026049799] [2024-10-11 19:12:00,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026049799] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:12:00,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:12:00,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-11 19:12:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595868763] [2024-10-11 19:12:00,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:12:00,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 19:12:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:00,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 19:12:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-11 19:12:00,700 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-11 19:12:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:02,584 INFO L93 Difference]: Finished difference Result 1410 states and 1991 transitions. [2024-10-11 19:12:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 19:12:02,586 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-11 19:12:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:02,588 INFO L225 Difference]: With dead ends: 1410 [2024-10-11 19:12:02,588 INFO L226 Difference]: Without dead ends: 1406 [2024-10-11 19:12:02,588 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-11 19:12:02,589 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 32 mSDsluCounter, 5890 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:02,589 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.6s Time] [2024-10-11 19:12:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-11 19:12:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1404. [2024-10-11 19:12:02,604 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-11 19:12:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1977 transitions. [2024-10-11 19:12:02,607 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1977 transitions. Word has length 80 [2024-10-11 19:12:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:02,607 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1977 transitions. [2024-10-11 19:12:02,607 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-11 19:12:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1977 transitions. [2024-10-11 19:12:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 19:12:02,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:02,608 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-11 19:12:02,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-11 19:12:02,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:02,809 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-11 19:12:02,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash 680455018, now seen corresponding path program 3 times [2024-10-11 19:12:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939079401] [2024-10-11 19:12:02,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:12:02,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:02,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:02,814 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:02,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-11 19:12:03,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:12:03,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:12:03,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 19:12:03,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:03,744 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-11 19:12:03,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:12:04,319 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-11 19:12:04,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:04,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939079401] [2024-10-11 19:12:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939079401] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:12:04,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:12:04,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-10-11 19:12:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415952913] [2024-10-11 19:12:04,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:12:04,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 19:12:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 19:12:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-10-11 19:12:04,322 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-11 19:12:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:09,426 INFO L93 Difference]: Finished difference Result 1446 states and 2049 transitions. [2024-10-11 19:12:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 19:12:09,426 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-11 19:12:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:09,429 INFO L225 Difference]: With dead ends: 1446 [2024-10-11 19:12:09,429 INFO L226 Difference]: Without dead ends: 1440 [2024-10-11 19:12:09,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 19:12:09,431 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 65 mSDsluCounter, 11047 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:09,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 11788 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 19:12:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-10-11 19:12:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2024-10-11 19:12:09,445 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-11 19:12:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2023 transitions. [2024-10-11 19:12:09,447 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2023 transitions. Word has length 86 [2024-10-11 19:12:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:09,448 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2023 transitions. [2024-10-11 19:12:09,448 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-11 19:12:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2023 transitions. [2024-10-11 19:12:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 19:12:09,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:09,449 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-11 19:12:09,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:09,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:09,650 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-11 19:12:09,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1913886614, now seen corresponding path program 4 times [2024-10-11 19:12:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:09,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644465108] [2024-10-11 19:12:09,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:12:09,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:09,652 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:09,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-11 19:12:10,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:12:10,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:12:10,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 19:12:10,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:10,889 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-11 19:12:10,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:12:12,276 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-11 19:12:12,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644465108] [2024-10-11 19:12:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644465108] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:12:12,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:12:12,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-11 19:12:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965380192] [2024-10-11 19:12:12,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:12:12,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 19:12:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:12,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 19:12:12,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 19:12:12,280 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)