./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:37:02,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:37:02,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:37:02,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:37:02,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:37:02,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:37:02,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:37:02,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:37:02,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:37:02,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:37:02,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:37:02,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:37:02,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:37:02,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:37:02,814 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:37:02,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:37:02,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:37:02,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:37:02,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:37:02,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:37:02,815 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:37:02,816 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:37:02,816 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:37:02,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:37:02,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:37:02,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:37:02,817 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:37:02,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:37:02,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:37:02,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:37:02,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:37:02,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:37:02,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:37:02,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:37:02,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:37:02,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:37:02,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:37:02,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:37:02,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:37:02,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:37:02,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:37:02,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:37:02,820 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-10 17:37:03,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:37:03,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:37:03,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:37:03,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:37:03,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:37:03,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-10 17:37:04,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:37:04,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:37:04,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-10 17:37:04,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ebdbafc3/299564fd1d2b459e8525901cdf1e84e7/FLAG68394b61b [2024-11-10 17:37:04,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ebdbafc3/299564fd1d2b459e8525901cdf1e84e7 [2024-11-10 17:37:04,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:37:04,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:37:04,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:37:04,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:37:04,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:37:04,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:37:04" (1/1) ... [2024-11-10 17:37:04,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d2d98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:04, skipping insertion in model container [2024-11-10 17:37:04,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:37:04" (1/1) ... [2024-11-10 17:37:04,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:37:05,130 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,167 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,171 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,175 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,183 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,220 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,222 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,224 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,228 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,230 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,232 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,233 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,233 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,234 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,236 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:05,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:37:05,263 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 17:37:05,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c0e05d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:05, skipping insertion in model container [2024-11-10 17:37:05,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:37:05,267 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:37:05,269 INFO L158 Benchmark]: Toolchain (without parser) took 613.41ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 122.0MB in the end (delta: -30.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-10 17:37:05,269 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:37:05,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.45ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 122.0MB in the end (delta: -30.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-10 17:37:05,271 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.20ms. Allocated memory is still 167.8MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.45ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 122.0MB in the end (delta: -30.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:37:07,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:37:07,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:37:07,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:37:07,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:37:07,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:37:07,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:37:07,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:37:07,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:37:07,216 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:37:07,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:37:07,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:37:07,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:37:07,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:37:07,218 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:37:07,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:37:07,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:37:07,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:37:07,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:37:07,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:37:07,219 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:37:07,220 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:37:07,220 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:37:07,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:37:07,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:37:07,220 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:37:07,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:37:07,221 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:37:07,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:37:07,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:37:07,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:37:07,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:37:07,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:37:07,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:37:07,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:37:07,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:37:07,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:37:07,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:37:07,222 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:37:07,222 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:37:07,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:37:07,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:37:07,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:37:07,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:37:07,224 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-10 17:37:07,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:37:07,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:37:07,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:37:07,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:37:07,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:37:07,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-10 17:37:09,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:37:09,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:37:09,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-10 17:37:09,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73094c95/d55173d6eb744350bfcfcca2f1586fa4/FLAG173d5d1a3 [2024-11-10 17:37:09,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73094c95/d55173d6eb744350bfcfcca2f1586fa4 [2024-11-10 17:37:09,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:37:09,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:37:09,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:37:09,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:37:09,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:37:09,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:37:09" (1/1) ... [2024-11-10 17:37:09,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600cfded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:09, skipping insertion in model container [2024-11-10 17:37:09,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:37:09" (1/1) ... [2024-11-10 17:37:09,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:37:10,079 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,109 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,113 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,117 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,124 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,161 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,163 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,165 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,165 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,166 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,171 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,172 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,174 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,175 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,177 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:37:10,198 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:37:10,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:37:10,218 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,234 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,235 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,241 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,265 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,288 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,291 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,293 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,295 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,297 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,299 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,301 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,302 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,303 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,304 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:37:10,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:37:10,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:37:10,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:37:10,445 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:37:10,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10 WrapperNode [2024-11-10 17:37:10,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:37:10,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:37:10,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:37:10,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:37:10,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,522 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1024 [2024-11-10 17:37:10,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:37:10,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:37:10,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:37:10,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:37:10,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,625 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-10 17:37:10,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,670 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:37:10,703 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:37:10,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:37:10,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:37:10,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (1/1) ... [2024-11-10 17:37:10,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:37:10,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:37:10,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:37:10,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:37:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:37:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:37:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 17:37:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:37:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:37:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 17:37:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:37:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:37:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:37:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:37:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:37:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:37:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:37:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:37:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:37:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:37:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:37:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:37:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 17:37:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:37:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:37:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:37:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 17:37:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:37:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:37:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:37:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:37:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:37:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:37:10,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:37:10,990 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:37:10,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:37:13,609 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-10 17:37:13,701 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-11-10 17:37:13,702 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:37:13,725 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:37:13,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:37:13,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:37:13 BoogieIcfgContainer [2024-11-10 17:37:13,726 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:37:13,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:37:13,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:37:13,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:37:13,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:37:09" (1/3) ... [2024-11-10 17:37:13,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f975686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:37:13, skipping insertion in model container [2024-11-10 17:37:13,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:10" (2/3) ... [2024-11-10 17:37:13,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f975686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:37:13, skipping insertion in model container [2024-11-10 17:37:13,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:37:13" (3/3) ... [2024-11-10 17:37:13,732 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-2.i [2024-11-10 17:37:13,745 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:37:13,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-11-10 17:37:13,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:37:13,798 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;@118a66bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:37:13,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-10 17:37:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 1086 states, 559 states have (on average 2.1592128801431127) internal successors, (1207), 1081 states have internal predecessors, (1207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 17:37:13,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:13,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 17:37:13,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:13,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 38571324, now seen corresponding path program 1 times [2024-11-10 17:37:13,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880951629] [2024-11-10 17:37:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:13,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:13,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:13,826 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:13,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 17:37:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:13,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:37:13,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:13,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-11-10 17:37:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:13,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:13,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880951629] [2024-11-10 17:37:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880951629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:13,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:37:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577179836] [2024-11-10 17:37:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:13,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:37:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:14,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:37:14,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:14,026 INFO L87 Difference]: Start difference. First operand has 1086 states, 559 states have (on average 2.1592128801431127) internal successors, (1207), 1081 states have internal predecessors, (1207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:15,516 INFO L93 Difference]: Finished difference Result 1257 states and 1325 transitions. [2024-11-10 17:37:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:37:15,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-10 17:37:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:15,545 INFO L225 Difference]: With dead ends: 1257 [2024-11-10 17:37:15,546 INFO L226 Difference]: Without dead ends: 1254 [2024-11-10 17:37:15,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:15,556 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 991 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:15,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 808 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:37:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-10 17:37:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1069. [2024-11-10 17:37:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 559 states have (on average 2.007155635062612) internal successors, (1122), 1064 states have internal predecessors, (1122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1128 transitions. [2024-11-10 17:37:15,639 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1128 transitions. Word has length 4 [2024-11-10 17:37:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:15,640 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1128 transitions. [2024-11-10 17:37:15,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1128 transitions. [2024-11-10 17:37:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 17:37:15,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:15,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 17:37:15,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 17:37:15,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:15,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr524REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:15,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 38571325, now seen corresponding path program 1 times [2024-11-10 17:37:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:15,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481164988] [2024-11-10 17:37:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:15,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:15,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:15,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:15,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:37:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:15,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:37:15,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:15,981 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-11-10 17:37:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:16,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:16,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481164988] [2024-11-10 17:37:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481164988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:16,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:16,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:37:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980904560] [2024-11-10 17:37:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:16,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:37:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:37:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:16,003 INFO L87 Difference]: Start difference. First operand 1069 states and 1128 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:17,990 INFO L93 Difference]: Finished difference Result 1495 states and 1586 transitions. [2024-11-10 17:37:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:37:17,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-10 17:37:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:17,995 INFO L225 Difference]: With dead ends: 1495 [2024-11-10 17:37:17,996 INFO L226 Difference]: Without dead ends: 1495 [2024-11-10 17:37:17,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:17,998 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 458 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:17,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1531 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 17:37:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-10 17:37:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1202. [2024-11-10 17:37:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 693 states have (on average 1.9610389610389611) internal successors, (1359), 1197 states have internal predecessors, (1359), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1365 transitions. [2024-11-10 17:37:18,041 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1365 transitions. Word has length 4 [2024-11-10 17:37:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:18,041 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1365 transitions. [2024-11-10 17:37:18,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1365 transitions. [2024-11-10 17:37:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 17:37:18,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:18,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 17:37:18,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:18,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:18,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:18,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1195672931, now seen corresponding path program 1 times [2024-11-10 17:37:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389922754] [2024-11-10 17:37:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:18,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:18,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:18,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:18,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 17:37:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:18,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:37:18,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:18,357 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48| (_ bv0 1))))) is different from true [2024-11-10 17:37:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:18,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:18,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:18,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389922754] [2024-11-10 17:37:18,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389922754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:18,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:18,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634614560] [2024-11-10 17:37:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:18,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:37:18,366 INFO L87 Difference]: Start difference. First operand 1202 states and 1365 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:20,019 INFO L93 Difference]: Finished difference Result 1481 states and 1570 transitions. [2024-11-10 17:37:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:20,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-10 17:37:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:20,024 INFO L225 Difference]: With dead ends: 1481 [2024-11-10 17:37:20,024 INFO L226 Difference]: Without dead ends: 1479 [2024-11-10 17:37:20,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:37:20,026 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 440 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1560 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:20,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1525 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 718 Invalid, 0 Unknown, 1560 Unchecked, 1.6s Time] [2024-11-10 17:37:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-11-10 17:37:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1202. [2024-11-10 17:37:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 693 states have (on average 1.9595959595959596) internal successors, (1358), 1197 states have internal predecessors, (1358), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1364 transitions. [2024-11-10 17:37:20,066 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1364 transitions. Word has length 5 [2024-11-10 17:37:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:20,067 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1364 transitions. [2024-11-10 17:37:20,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1364 transitions. [2024-11-10 17:37:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:37:20,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:20,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:20,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:20,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:20,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr520REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:20,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash -767703104, now seen corresponding path program 1 times [2024-11-10 17:37:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:20,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573488709] [2024-11-10 17:37:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:20,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:20,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:20,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:20,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 17:37:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:20,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:37:20,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:20,395 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-11-10 17:37:20,403 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-11-10 17:37:20,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:37:20,482 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-11-10 17:37:20,501 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:37:20,501 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-11-10 17:37:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:20,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:20,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573488709] [2024-11-10 17:37:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573488709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163020303] [2024-11-10 17:37:20,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:20,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:20,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:20,530 INFO L87 Difference]: Start difference. First operand 1202 states and 1364 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:22,384 INFO L93 Difference]: Finished difference Result 1376 states and 1546 transitions. [2024-11-10 17:37:22,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:22,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-10 17:37:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:22,388 INFO L225 Difference]: With dead ends: 1376 [2024-11-10 17:37:22,388 INFO L226 Difference]: Without dead ends: 1376 [2024-11-10 17:37:22,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-11-10 17:37:22,389 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1280 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:22,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 478 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:37:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-10 17:37:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1057. [2024-11-10 17:37:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 559 states have (on average 1.9821109123434706) internal successors, (1108), 1052 states have internal predecessors, (1108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1114 transitions. [2024-11-10 17:37:22,402 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1114 transitions. Word has length 9 [2024-11-10 17:37:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:22,403 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1114 transitions. [2024-11-10 17:37:22,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1114 transitions. [2024-11-10 17:37:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 17:37:22,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:22,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:22,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 17:37:22,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:22,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:22,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1971008690, now seen corresponding path program 1 times [2024-11-10 17:37:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:22,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197931132] [2024-11-10 17:37:22,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:22,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:22,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:22,608 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:22,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 17:37:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:22,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:37:22,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:22,705 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-11-10 17:37:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:22,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:22,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:22,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197931132] [2024-11-10 17:37:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197931132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:22,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:37:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772081053] [2024-11-10 17:37:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:37:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:37:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:22,715 INFO L87 Difference]: Start difference. First operand 1057 states and 1114 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:23,876 INFO L93 Difference]: Finished difference Result 1230 states and 1308 transitions. [2024-11-10 17:37:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:37:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-10 17:37:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:23,880 INFO L225 Difference]: With dead ends: 1230 [2024-11-10 17:37:23,880 INFO L226 Difference]: Without dead ends: 1230 [2024-11-10 17:37:23,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:23,882 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 766 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:23,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1161 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:37:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-10 17:37:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1010. [2024-11-10 17:37:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 559 states have (on average 1.8980322003577819) internal successors, (1061), 1005 states have internal predecessors, (1061), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1067 transitions. [2024-11-10 17:37:23,900 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1067 transitions. Word has length 10 [2024-11-10 17:37:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:23,901 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1067 transitions. [2024-11-10 17:37:23,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1067 transitions. [2024-11-10 17:37:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 17:37:23,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:23,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:23,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 17:37:24,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:24,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:24,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1971008691, now seen corresponding path program 1 times [2024-11-10 17:37:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837000142] [2024-11-10 17:37:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:24,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:24,107 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:24,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 17:37:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:24,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:37:24,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:24,251 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-11-10 17:37:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:24,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:24,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837000142] [2024-11-10 17:37:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837000142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:24,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:24,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:37:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671306080] [2024-11-10 17:37:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:24,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:37:24,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:24,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:37:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:24,297 INFO L87 Difference]: Start difference. First operand 1010 states and 1067 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:25,759 INFO L93 Difference]: Finished difference Result 1308 states and 1389 transitions. [2024-11-10 17:37:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:37:25,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-10 17:37:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:25,763 INFO L225 Difference]: With dead ends: 1308 [2024-11-10 17:37:25,763 INFO L226 Difference]: Without dead ends: 1308 [2024-11-10 17:37:25,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:25,764 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 513 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:25,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1517 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:37:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-11-10 17:37:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1039. [2024-11-10 17:37:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 598 states have (on average 1.8846153846153846) internal successors, (1127), 1034 states have internal predecessors, (1127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1133 transitions. [2024-11-10 17:37:25,777 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1133 transitions. Word has length 10 [2024-11-10 17:37:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:25,777 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1133 transitions. [2024-11-10 17:37:25,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1133 transitions. [2024-11-10 17:37:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 17:37:25,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:25,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:25,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 17:37:25,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:25,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:25,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1422651079, now seen corresponding path program 1 times [2024-11-10 17:37:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:25,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811061545] [2024-11-10 17:37:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:25,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:25,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:25,983 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:25,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 17:37:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:26,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:37:26,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:26,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:26,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:26,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811061545] [2024-11-10 17:37:26,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811061545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:26,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34844781] [2024-11-10 17:37:26,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:26,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:37:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:37:26,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:26,160 INFO L87 Difference]: Start difference. First operand 1039 states and 1133 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:26,335 INFO L93 Difference]: Finished difference Result 1490 states and 1639 transitions. [2024-11-10 17:37:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:37:26,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-10 17:37:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:26,339 INFO L225 Difference]: With dead ends: 1490 [2024-11-10 17:37:26,339 INFO L226 Difference]: Without dead ends: 1490 [2024-11-10 17:37:26,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:26,340 INFO L432 NwaCegarLoop]: 1119 mSDtfsCounter, 475 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:26,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 2083 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:37:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-11-10 17:37:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1218. [2024-11-10 17:37:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 777 states have (on average 1.833976833976834) internal successors, (1425), 1213 states have internal predecessors, (1425), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1431 transitions. [2024-11-10 17:37:26,355 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1431 transitions. Word has length 14 [2024-11-10 17:37:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:26,355 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1431 transitions. [2024-11-10 17:37:26,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1431 transitions. [2024-11-10 17:37:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 17:37:26,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:26,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:26,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 17:37:26,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:26,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr193REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:26,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 586733750, now seen corresponding path program 1 times [2024-11-10 17:37:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661415714] [2024-11-10 17:37:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:26,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:26,562 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:26,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 17:37:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:26,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:37:26,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:26,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:26,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:26,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661415714] [2024-11-10 17:37:26,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661415714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:26,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:26,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:26,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021033261] [2024-11-10 17:37:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:26,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:37:26,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:26,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:37:26,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:26,681 INFO L87 Difference]: Start difference. First operand 1218 states and 1431 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-10 17:37:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:26,703 INFO L93 Difference]: Finished difference Result 1158 states and 1345 transitions. [2024-11-10 17:37:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:37:26,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-10 17:37:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:26,706 INFO L225 Difference]: With dead ends: 1158 [2024-11-10 17:37:26,707 INFO L226 Difference]: Without dead ends: 1158 [2024-11-10 17:37:26,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:26,708 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 71 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:26,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1924 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:37:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-10 17:37:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-11-10 17:37:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 741 states have (on average 1.8070175438596492) internal successors, (1339), 1153 states have internal predecessors, (1339), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1345 transitions. [2024-11-10 17:37:26,725 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1345 transitions. Word has length 17 [2024-11-10 17:37:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:26,725 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1345 transitions. [2024-11-10 17:37:26,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-10 17:37:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1345 transitions. [2024-11-10 17:37:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 17:37:26,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:26,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:26,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 17:37:26,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:26,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash -495457004, now seen corresponding path program 1 times [2024-11-10 17:37:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819351829] [2024-11-10 17:37:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:26,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-11-10 17:37:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:26,931 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:26,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 17:37:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:27,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:37:27,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:27,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:27,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819351829] [2024-11-10 17:37:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819351829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:27,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:27,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:37:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581430415] [2024-11-10 17:37:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:27,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:27,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:27,113 INFO L87 Difference]: Start difference. First operand 1158 states and 1345 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:27,486 INFO L93 Difference]: Finished difference Result 1409 states and 1556 transitions. [2024-11-10 17:37:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:27,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-10 17:37:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:27,490 INFO L225 Difference]: With dead ends: 1409 [2024-11-10 17:37:27,490 INFO L226 Difference]: Without dead ends: 1409 [2024-11-10 17:37:27,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:27,490 INFO L432 NwaCegarLoop]: 1075 mSDtfsCounter, 436 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:27,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 2965 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 17:37:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-10 17:37:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1161. [2024-11-10 17:37:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 744 states have (on average 1.803763440860215) internal successors, (1342), 1156 states have internal predecessors, (1342), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1348 transitions. [2024-11-10 17:37:27,503 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1348 transitions. Word has length 18 [2024-11-10 17:37:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:27,504 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1348 transitions. [2024-11-10 17:37:27,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1348 transitions. [2024-11-10 17:37:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 17:37:27,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:27,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:27,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 17:37:27,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:27,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:27,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1820459967, now seen corresponding path program 1 times [2024-11-10 17:37:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:27,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420683211] [2024-11-10 17:37:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:27,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:27,711 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:27,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 17:37:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:27,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:37:27,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:27,935 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_49| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49|)))) is different from true [2024-11-10 17:37:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:27,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:27,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420683211] [2024-11-10 17:37:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420683211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:27,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:27,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895491369] [2024-11-10 17:37:27,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:27,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:27,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:27,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:27,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:37:27,943 INFO L87 Difference]: Start difference. First operand 1161 states and 1348 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:28,846 INFO L93 Difference]: Finished difference Result 1263 states and 1461 transitions. [2024-11-10 17:37:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-10 17:37:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:28,850 INFO L225 Difference]: With dead ends: 1263 [2024-11-10 17:37:28,850 INFO L226 Difference]: Without dead ends: 1255 [2024-11-10 17:37:28,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:37:28,850 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 103 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1123 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:28,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1536 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 473 Invalid, 0 Unknown, 1123 Unchecked, 0.9s Time] [2024-11-10 17:37:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-10 17:37:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1230. [2024-11-10 17:37:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 813 states have (on average 1.7773677736777367) internal successors, (1445), 1225 states have internal predecessors, (1445), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1451 transitions. [2024-11-10 17:37:28,869 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1451 transitions. Word has length 19 [2024-11-10 17:37:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:28,869 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1451 transitions. [2024-11-10 17:37:28,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1451 transitions. [2024-11-10 17:37:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 17:37:28,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:28,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:28,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 17:37:29,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:29,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr169REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:29,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:29,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1210361418, now seen corresponding path program 1 times [2024-11-10 17:37:29,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:29,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011093485] [2024-11-10 17:37:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:29,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:29,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:29,073 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:29,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 17:37:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:29,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:37:29,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:29,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:29,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011093485] [2024-11-10 17:37:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011093485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:29,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:37:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467027689] [2024-11-10 17:37:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:29,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:29,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:29,195 INFO L87 Difference]: Start difference. First operand 1230 states and 1451 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:29,246 INFO L93 Difference]: Finished difference Result 1192 states and 1364 transitions. [2024-11-10 17:37:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:37:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-10 17:37:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:29,249 INFO L225 Difference]: With dead ends: 1192 [2024-11-10 17:37:29,249 INFO L226 Difference]: Without dead ends: 1192 [2024-11-10 17:37:29,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:29,249 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 48 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:29,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2820 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:37:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-10 17:37:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2024-11-10 17:37:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 789 states have (on average 1.721166032953105) internal successors, (1358), 1187 states have internal predecessors, (1358), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1364 transitions. [2024-11-10 17:37:29,262 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1364 transitions. Word has length 19 [2024-11-10 17:37:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:29,262 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1364 transitions. [2024-11-10 17:37:29,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1364 transitions. [2024-11-10 17:37:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 17:37:29,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:29,265 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] [2024-11-10 17:37:29,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 17:37:29,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:29,466 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:29,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash -550509454, now seen corresponding path program 1 times [2024-11-10 17:37:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:29,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946687114] [2024-11-10 17:37:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:29,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:29,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:29,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 17:37:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:29,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:37:29,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:29,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:29,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:29,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946687114] [2024-11-10 17:37:29,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946687114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:29,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:29,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934096336] [2024-11-10 17:37:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:29,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:37:29,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:29,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:37:29,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:29,626 INFO L87 Difference]: Start difference. First operand 1192 states and 1364 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:29,651 INFO L93 Difference]: Finished difference Result 1132 states and 1278 transitions. [2024-11-10 17:37:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:37:29,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-10 17:37:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:29,655 INFO L225 Difference]: With dead ends: 1132 [2024-11-10 17:37:29,655 INFO L226 Difference]: Without dead ends: 1132 [2024-11-10 17:37:29,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:37:29,656 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 71 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:29,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1768 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:37:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-10 17:37:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2024-11-10 17:37:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 753 states have (on average 1.6892430278884463) internal successors, (1272), 1127 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1278 transitions. [2024-11-10 17:37:29,668 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1278 transitions. Word has length 21 [2024-11-10 17:37:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:29,669 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1278 transitions. [2024-11-10 17:37:29,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1278 transitions. [2024-11-10 17:37:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 17:37:29,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:29,669 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] [2024-11-10 17:37:29,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 17:37:29,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:29,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr485REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:29,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash -758642810, now seen corresponding path program 1 times [2024-11-10 17:37:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:29,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29866616] [2024-11-10 17:37:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:29,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:29,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:29,877 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:29,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 17:37:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:30,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:37:30,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:30,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:30,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29866616] [2024-11-10 17:37:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29866616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:30,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:30,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:37:30,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413344703] [2024-11-10 17:37:30,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:30,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:30,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:30,041 INFO L87 Difference]: Start difference. First operand 1132 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:30,092 INFO L93 Difference]: Finished difference Result 1102 states and 1220 transitions. [2024-11-10 17:37:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:37:30,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-10 17:37:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:30,098 INFO L225 Difference]: With dead ends: 1102 [2024-11-10 17:37:30,098 INFO L226 Difference]: Without dead ends: 1102 [2024-11-10 17:37:30,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:30,098 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 48 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:30,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2586 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:37:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-10 17:37:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2024-11-10 17:37:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 737 states have (on average 1.6472184531886025) internal successors, (1214), 1097 states have internal predecessors, (1214), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1220 transitions. [2024-11-10 17:37:30,113 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1220 transitions. Word has length 23 [2024-11-10 17:37:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:30,113 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1220 transitions. [2024-11-10 17:37:30,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1220 transitions. [2024-11-10 17:37:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 17:37:30,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:30,114 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] [2024-11-10 17:37:30,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:30,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:30,315 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1675753888, now seen corresponding path program 1 times [2024-11-10 17:37:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711029556] [2024-11-10 17:37:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:30,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:30,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:30,317 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:30,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 17:37:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:30,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:37:30,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:30,430 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-11-10 17:37:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:30,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:30,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:30,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711029556] [2024-11-10 17:37:30,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711029556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:30,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:30,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210918528] [2024-11-10 17:37:30,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:30,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:30,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:30,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:30,496 INFO L87 Difference]: Start difference. First operand 1102 states and 1220 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:31,846 INFO L93 Difference]: Finished difference Result 1295 states and 1414 transitions. [2024-11-10 17:37:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-10 17:37:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:31,850 INFO L225 Difference]: With dead ends: 1295 [2024-11-10 17:37:31,850 INFO L226 Difference]: Without dead ends: 1295 [2024-11-10 17:37:31,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:31,851 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 795 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:31,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1167 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:37:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-10 17:37:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1098. [2024-11-10 17:37:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 737 states have (on average 1.6309362279511532) internal successors, (1202), 1093 states have internal predecessors, (1202), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1208 transitions. [2024-11-10 17:37:31,868 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1208 transitions. Word has length 33 [2024-11-10 17:37:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:31,869 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1208 transitions. [2024-11-10 17:37:31,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1208 transitions. [2024-11-10 17:37:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 17:37:31,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:31,870 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] [2024-11-10 17:37:31,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:32,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:32,071 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:32,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1675753889, now seen corresponding path program 1 times [2024-11-10 17:37:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864724535] [2024-11-10 17:37:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:32,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:32,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:32,073 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:32,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 17:37:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:32,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:37:32,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:32,226 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-11-10 17:37:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:32,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:32,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864724535] [2024-11-10 17:37:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864724535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:32,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:32,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679206983] [2024-11-10 17:37:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:32,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:32,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:32,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:32,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:32,386 INFO L87 Difference]: Start difference. First operand 1098 states and 1208 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:33,791 INFO L93 Difference]: Finished difference Result 1105 states and 1210 transitions. [2024-11-10 17:37:33,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:33,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-10 17:37:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:33,794 INFO L225 Difference]: With dead ends: 1105 [2024-11-10 17:37:33,794 INFO L226 Difference]: Without dead ends: 1105 [2024-11-10 17:37:33,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:33,795 INFO L432 NwaCegarLoop]: 877 mSDtfsCounter, 80 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:33,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1824 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:37:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-10 17:37:33,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1098. [2024-11-10 17:37:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 737 states have (on average 1.6255088195386702) internal successors, (1198), 1093 states have internal predecessors, (1198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1204 transitions. [2024-11-10 17:37:33,805 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1204 transitions. Word has length 33 [2024-11-10 17:37:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:33,805 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1204 transitions. [2024-11-10 17:37:33,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1204 transitions. [2024-11-10 17:37:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 17:37:33,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:33,806 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] [2024-11-10 17:37:33,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:34,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:34,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:34,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:34,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1103966556, now seen corresponding path program 1 times [2024-11-10 17:37:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:34,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500602166] [2024-11-10 17:37:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:34,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:34,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:34,009 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:34,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 17:37:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:34,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:37:34,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:34,241 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-11-10 17:37:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:34,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:34,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500602166] [2024-11-10 17:37:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500602166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:34,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167765002] [2024-11-10 17:37:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:34,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:34,324 INFO L87 Difference]: Start difference. First operand 1098 states and 1204 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:35,461 INFO L93 Difference]: Finished difference Result 1105 states and 1206 transitions. [2024-11-10 17:37:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-10 17:37:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:35,464 INFO L225 Difference]: With dead ends: 1105 [2024-11-10 17:37:35,465 INFO L226 Difference]: Without dead ends: 1105 [2024-11-10 17:37:35,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:35,465 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 617 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:35,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1287 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:37:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-10 17:37:35,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1094. [2024-11-10 17:37:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 737 states have (on average 1.6146540027137042) internal successors, (1190), 1089 states have internal predecessors, (1190), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1196 transitions. [2024-11-10 17:37:35,480 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1196 transitions. Word has length 37 [2024-11-10 17:37:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:35,480 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1196 transitions. [2024-11-10 17:37:35,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1196 transitions. [2024-11-10 17:37:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 17:37:35,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:35,485 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] [2024-11-10 17:37:35,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:35,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:35,686 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr472REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:35,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1103966557, now seen corresponding path program 1 times [2024-11-10 17:37:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:35,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343444021] [2024-11-10 17:37:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:35,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:35,690 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:35,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-10 17:37:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:35,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:37:35,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:35,887 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-11-10 17:37:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:36,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:36,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343444021] [2024-11-10 17:37:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343444021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:36,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517099728] [2024-11-10 17:37:36,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:36,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:36,063 INFO L87 Difference]: Start difference. First operand 1094 states and 1196 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:37,715 INFO L93 Difference]: Finished difference Result 1361 states and 1448 transitions. [2024-11-10 17:37:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:37,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-10 17:37:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:37,719 INFO L225 Difference]: With dead ends: 1361 [2024-11-10 17:37:37,719 INFO L226 Difference]: Without dead ends: 1361 [2024-11-10 17:37:37,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:37,719 INFO L432 NwaCegarLoop]: 997 mSDtfsCounter, 360 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:37,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1989 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:37:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-10 17:37:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1090. [2024-11-10 17:37:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 737 states have (on average 1.6037991858887382) internal successors, (1182), 1085 states have internal predecessors, (1182), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1188 transitions. [2024-11-10 17:37:37,729 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1188 transitions. Word has length 37 [2024-11-10 17:37:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:37,730 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1188 transitions. [2024-11-10 17:37:37,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1188 transitions. [2024-11-10 17:37:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 17:37:37,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:37,730 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] [2024-11-10 17:37:37,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:37,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:37,932 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:37,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1429023718, now seen corresponding path program 1 times [2024-11-10 17:37:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806709059] [2024-11-10 17:37:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:37,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:37,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:37,937 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:37,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 17:37:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:38,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:37:38,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:38,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:38,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806709059] [2024-11-10 17:37:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806709059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:38,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:38,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:37:38,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971868940] [2024-11-10 17:37:38,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:38,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:38,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:38,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:38,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:38,096 INFO L87 Difference]: Start difference. First operand 1090 states and 1188 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:38,145 INFO L93 Difference]: Finished difference Result 1072 states and 1158 transitions. [2024-11-10 17:37:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:37:38,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-11-10 17:37:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:38,148 INFO L225 Difference]: With dead ends: 1072 [2024-11-10 17:37:38,148 INFO L226 Difference]: Without dead ends: 1072 [2024-11-10 17:37:38,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:38,148 INFO L432 NwaCegarLoop]: 861 mSDtfsCounter, 27 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:38,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2545 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:37:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-10 17:37:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2024-11-10 17:37:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 719 states have (on average 1.6022253129346313) internal successors, (1152), 1067 states have internal predecessors, (1152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1158 transitions. [2024-11-10 17:37:38,159 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1158 transitions. Word has length 53 [2024-11-10 17:37:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:38,159 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1158 transitions. [2024-11-10 17:37:38,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1158 transitions. [2024-11-10 17:37:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 17:37:38,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:38,161 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] [2024-11-10 17:37:38,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:38,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:38,362 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:38,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1386542889, now seen corresponding path program 1 times [2024-11-10 17:37:38,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:38,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515083515] [2024-11-10 17:37:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:38,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:38,367 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:38,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-10 17:37:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:38,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:37:38,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:38,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:38,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515083515] [2024-11-10 17:37:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515083515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:38,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:38,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:37:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446407880] [2024-11-10 17:37:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:38,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:38,578 INFO L87 Difference]: Start difference. First operand 1072 states and 1158 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:38,616 INFO L93 Difference]: Finished difference Result 1060 states and 1138 transitions. [2024-11-10 17:37:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:37:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2024-11-10 17:37:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:38,619 INFO L225 Difference]: With dead ends: 1060 [2024-11-10 17:37:38,620 INFO L226 Difference]: Without dead ends: 1060 [2024-11-10 17:37:38,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:38,620 INFO L432 NwaCegarLoop]: 857 mSDtfsCounter, 21 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:38,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2539 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:37:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-10 17:37:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-10 17:37:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 707 states have (on average 1.6011315417256011) internal successors, (1132), 1055 states have internal predecessors, (1132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1138 transitions. [2024-11-10 17:37:38,630 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1138 transitions. Word has length 57 [2024-11-10 17:37:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:38,630 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1138 transitions. [2024-11-10 17:37:38,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1138 transitions. [2024-11-10 17:37:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 17:37:38,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:38,631 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] [2024-11-10 17:37:38,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:38,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:38,832 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:38,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash -365650590, now seen corresponding path program 1 times [2024-11-10 17:37:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815654917] [2024-11-10 17:37:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:38,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:38,834 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:38,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-10 17:37:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:39,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:37:39,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:39,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:37:39,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:37:39,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:37:39,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-10 17:37:39,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:37:39,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-10 17:37:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:39,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:39,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:39,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815654917] [2024-11-10 17:37:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815654917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:39,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:39,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:37:39,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372081051] [2024-11-10 17:37:39,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:39,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:37:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:39,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:37:39,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:37:39,141 INFO L87 Difference]: Start difference. First operand 1060 states and 1138 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:39,412 INFO L93 Difference]: Finished difference Result 1544 states and 1643 transitions. [2024-11-10 17:37:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:37:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 61 [2024-11-10 17:37:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:39,416 INFO L225 Difference]: With dead ends: 1544 [2024-11-10 17:37:39,416 INFO L226 Difference]: Without dead ends: 1540 [2024-11-10 17:37:39,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:37:39,417 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 1229 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:39,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 3155 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:37:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-10 17:37:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1004. [2024-11-10 17:37:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 651 states have (on average 1.6497695852534562) internal successors, (1074), 999 states have internal predecessors, (1074), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1080 transitions. [2024-11-10 17:37:39,428 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1080 transitions. Word has length 61 [2024-11-10 17:37:39,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:39,429 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1080 transitions. [2024-11-10 17:37:39,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1080 transitions. [2024-11-10 17:37:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 17:37:39,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:39,429 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] [2024-11-10 17:37:39,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:39,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:39,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:39,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash -989927393, now seen corresponding path program 1 times [2024-11-10 17:37:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:39,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990007958] [2024-11-10 17:37:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:39,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:39,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:39,633 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:39,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-10 17:37:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:39,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:37:39,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:39,908 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-11-10 17:37:39,918 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-11-10 17:37:40,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:37:40,324 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-11-10 17:37:40,334 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:37:40,335 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-11-10 17:37:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:40,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:40,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990007958] [2024-11-10 17:37:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990007958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:40,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:37:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255395850] [2024-11-10 17:37:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:40,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:40,346 INFO L87 Difference]: Start difference. First operand 1004 states and 1080 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:41,377 INFO L93 Difference]: Finished difference Result 966 states and 1042 transitions. [2024-11-10 17:37:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:41,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-11-10 17:37:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:41,379 INFO L225 Difference]: With dead ends: 966 [2024-11-10 17:37:41,379 INFO L226 Difference]: Without dead ends: 966 [2024-11-10 17:37:41,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-11-10 17:37:41,380 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 1074 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:41,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 579 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:37:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-10 17:37:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 927. [2024-11-10 17:37:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 612 states have (on average 1.5686274509803921) internal successors, (960), 922 states have internal predecessors, (960), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 966 transitions. [2024-11-10 17:37:41,391 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 966 transitions. Word has length 65 [2024-11-10 17:37:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:41,393 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 966 transitions. [2024-11-10 17:37:41,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 966 transitions. [2024-11-10 17:37:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:37:41,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:41,394 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-11-10 17:37:41,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:41,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:41,595 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:41,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash -150817521, now seen corresponding path program 1 times [2024-11-10 17:37:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:41,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935464580] [2024-11-10 17:37:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:41,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:41,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:41,597 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:41,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-10 17:37:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:41,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:37:41,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:41,823 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-11-10 17:37:41,835 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-11-10 17:37:41,851 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-11-10 17:37:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:41,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:41,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:41,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935464580] [2024-11-10 17:37:41,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935464580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:41,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:41,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:37:41,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553002091] [2024-11-10 17:37:41,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:41,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:37:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:41,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:37:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:41,860 INFO L87 Difference]: Start difference. First operand 927 states and 966 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:43,180 INFO L93 Difference]: Finished difference Result 926 states and 965 transitions. [2024-11-10 17:37:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:37:43,181 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), 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 70 [2024-11-10 17:37:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:43,186 INFO L225 Difference]: With dead ends: 926 [2024-11-10 17:37:43,187 INFO L226 Difference]: Without dead ends: 926 [2024-11-10 17:37:43,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:37:43,187 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 2 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:43,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2164 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:37:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-10 17:37:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2024-11-10 17:37:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 612 states have (on average 1.5669934640522876) internal successors, (959), 921 states have internal predecessors, (959), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 965 transitions. [2024-11-10 17:37:43,195 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 965 transitions. Word has length 70 [2024-11-10 17:37:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:43,195 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 965 transitions. [2024-11-10 17:37:43,195 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 965 transitions. [2024-11-10 17:37:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:37:43,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:43,196 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-11-10 17:37:43,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:43,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:43,396 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:43,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash -150817520, now seen corresponding path program 1 times [2024-11-10 17:37:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:43,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212266408] [2024-11-10 17:37:43,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:43,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:43,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:43,399 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:43,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-10 17:37:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:43,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 17:37:43,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:43,647 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-11-10 17:37:43,665 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-11-10 17:37:43,674 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-11-10 17:37:43,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 17:37:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:43,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:43,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212266408] [2024-11-10 17:37:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212266408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:43,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:37:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680313249] [2024-11-10 17:37:43,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:43,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:37:43,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:43,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:37:43,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:37:43,715 INFO L87 Difference]: Start difference. First operand 926 states and 965 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:45,524 INFO L93 Difference]: Finished difference Result 925 states and 964 transitions. [2024-11-10 17:37:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:37:45,525 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), 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 70 [2024-11-10 17:37:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:45,527 INFO L225 Difference]: With dead ends: 925 [2024-11-10 17:37:45,527 INFO L226 Difference]: Without dead ends: 925 [2024-11-10 17:37:45,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:37:45,527 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 1 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:45,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2196 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:37:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-10 17:37:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2024-11-10 17:37:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 611 states have (on average 1.5679214402618658) internal successors, (958), 920 states have internal predecessors, (958), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:37:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 964 transitions. [2024-11-10 17:37:45,544 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 964 transitions. Word has length 70 [2024-11-10 17:37:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:45,544 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 964 transitions. [2024-11-10 17:37:45,545 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:37:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 964 transitions. [2024-11-10 17:37:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:37:45,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:45,549 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, 1] [2024-11-10 17:37:45,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-10 17:37:45,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:45,753 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:45,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash -546754771, now seen corresponding path program 1 times [2024-11-10 17:37:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:45,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384528302] [2024-11-10 17:37:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:45,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:45,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:45,758 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:45,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-10 17:37:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:45,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:37:45,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:46,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:37:46,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:46,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384528302] [2024-11-10 17:37:46,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384528302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:37:46,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:37:46,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:37:46,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734317956] [2024-11-10 17:37:46,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:37:46,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:37:46,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:46,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:37:46,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:46,020 INFO L87 Difference]: Start difference. First operand 925 states and 964 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-11-10 17:37:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:46,060 INFO L93 Difference]: Finished difference Result 928 states and 968 transitions. [2024-11-10 17:37:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:37:46,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 78 [2024-11-10 17:37:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:46,065 INFO L225 Difference]: With dead ends: 928 [2024-11-10 17:37:46,065 INFO L226 Difference]: Without dead ends: 928 [2024-11-10 17:37:46,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:37:46,066 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 0 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:46,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2485 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:37:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-10 17:37:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2024-11-10 17:37:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 613 states have (on average 1.567699836867863) internal successors, (961), 923 states have internal predecessors, (961), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:37:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 968 transitions. [2024-11-10 17:37:46,086 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 968 transitions. Word has length 78 [2024-11-10 17:37:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:46,086 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 968 transitions. [2024-11-10 17:37:46,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-11-10 17:37:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 968 transitions. [2024-11-10 17:37:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 17:37:46,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:46,092 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, 1, 1] [2024-11-10 17:37:46,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-10 17:37:46,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:46,292 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:46,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1867228317, now seen corresponding path program 1 times [2024-11-10 17:37:46,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:46,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949404374] [2024-11-10 17:37:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:37:46,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:46,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:46,295 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:46,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-10 17:37:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:37:46,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:37:46,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:46,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:37:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:46,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:46,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949404374] [2024-11-10 17:37:46,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949404374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:37:46,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:37:46,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:37:46,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588107820] [2024-11-10 17:37:46,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:37:46,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:37:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:37:46,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:37:46,603 INFO L87 Difference]: Start difference. First operand 928 states and 968 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:37:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:46,785 INFO L93 Difference]: Finished difference Result 940 states and 985 transitions. [2024-11-10 17:37:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:37:46,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2024-11-10 17:37:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:46,788 INFO L225 Difference]: With dead ends: 940 [2024-11-10 17:37:46,788 INFO L226 Difference]: Without dead ends: 940 [2024-11-10 17:37:46,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:37:46,788 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 8 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:46,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2488 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:37:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-10 17:37:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 938. [2024-11-10 17:37:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 622 states have (on average 1.5691318327974277) internal successors, (976), 932 states have internal predecessors, (976), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:37:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 983 transitions. [2024-11-10 17:37:46,800 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 983 transitions. Word has length 79 [2024-11-10 17:37:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:46,801 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 983 transitions. [2024-11-10 17:37:46,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:37:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 983 transitions. [2024-11-10 17:37:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 17:37:46,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:46,803 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, 1, 1] [2024-11-10 17:37:46,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-10 17:37:47,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:47,004 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:47,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1861061805, now seen corresponding path program 2 times [2024-11-10 17:37:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752532334] [2024-11-10 17:37:47,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:37:47,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:47,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:47,007 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:47,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-10 17:37:47,510 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:37:47,510 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:37:47,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:37:47,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:47,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:37:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:47,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:47,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752532334] [2024-11-10 17:37:47,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752532334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:37:47,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:37:47,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:37:47,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606697971] [2024-11-10 17:37:47,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:37:47,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:37:47,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:47,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:37:47,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:37:47,811 INFO L87 Difference]: Start difference. First operand 938 states and 983 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:37:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:48,428 INFO L93 Difference]: Finished difference Result 953 states and 1005 transitions. [2024-11-10 17:37:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:37:48,429 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-11-10 17:37:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:48,431 INFO L225 Difference]: With dead ends: 953 [2024-11-10 17:37:48,431 INFO L226 Difference]: Without dead ends: 949 [2024-11-10 17:37:48,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:37:48,432 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 12 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4968 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:48,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4968 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 17:37:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-10 17:37:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 947. [2024-11-10 17:37:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 631 states have (on average 1.565768621236133) internal successors, (988), 941 states have internal predecessors, (988), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:37:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 995 transitions. [2024-11-10 17:37:48,463 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 995 transitions. Word has length 82 [2024-11-10 17:37:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:48,463 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 995 transitions. [2024-11-10 17:37:48,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:37:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 995 transitions. [2024-11-10 17:37:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:37:48,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:48,464 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, 1, 1] [2024-11-10 17:37:48,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:48,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:48,665 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:48,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:48,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1143344915, now seen corresponding path program 3 times [2024-11-10 17:37:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:48,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440305815] [2024-11-10 17:37:48,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:37:48,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:48,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:48,669 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:48,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-10 17:37:49,256 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:37:49,256 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:37:49,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:37:49,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:49,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:37:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:50,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440305815] [2024-11-10 17:37:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440305815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:37:50,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:37:50,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:37:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684276590] [2024-11-10 17:37:50,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:37:50,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:37:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:37:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:37:50,242 INFO L87 Difference]: Start difference. First operand 947 states and 995 transitions. Second operand has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:37:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:51,569 INFO L93 Difference]: Finished difference Result 971 states and 1034 transitions. [2024-11-10 17:37:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:37:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-10 17:37:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:51,571 INFO L225 Difference]: With dead ends: 971 [2024-11-10 17:37:51,572 INFO L226 Difference]: Without dead ends: 965 [2024-11-10 17:37:51,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:37:51,573 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 26 mSDsluCounter, 9110 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9941 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:51,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9941 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:37:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-10 17:37:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2024-11-10 17:37:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 649 states have (on average 1.5577812018489985) internal successors, (1011), 959 states have internal predecessors, (1011), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:37:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1018 transitions. [2024-11-10 17:37:51,581 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1018 transitions. Word has length 88 [2024-11-10 17:37:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:51,581 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1018 transitions. [2024-11-10 17:37:51,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:37:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1018 transitions. [2024-11-10 17:37:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 17:37:51,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:51,582 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, 1, 1] [2024-11-10 17:37:51,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:51,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:51,783 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -357422739, now seen corresponding path program 4 times [2024-11-10 17:37:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:51,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372953109] [2024-11-10 17:37:51,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:37:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:51,786 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:51,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-10 17:37:52,211 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:37:52,212 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:37:52,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:37:52,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:52,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:37:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:37:53,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:37:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372953109] [2024-11-10 17:37:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372953109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:37:53,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:37:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:37:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308783266] [2024-11-10 17:37:53,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:37:53,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:37:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:37:53,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:37:53,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:37:53,600 INFO L87 Difference]: Start difference. First operand 965 states and 1018 transitions. Second operand has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:37:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:37:57,693 INFO L93 Difference]: Finished difference Result 1005 states and 1090 transitions. [2024-11-10 17:37:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:37:57,694 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-10 17:37:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:37:57,703 INFO L225 Difference]: With dead ends: 1005 [2024-11-10 17:37:57,703 INFO L226 Difference]: Without dead ends: 1001 [2024-11-10 17:37:57,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:37:57,706 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 27 mSDsluCounter, 19024 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19854 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:37:57,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19854 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:37:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-10 17:37:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 999. [2024-11-10 17:37:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 683 states have (on average 1.547584187408492) internal successors, (1057), 993 states have internal predecessors, (1057), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:37:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1064 transitions. [2024-11-10 17:37:57,727 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1064 transitions. Word has length 100 [2024-11-10 17:37:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:37:57,727 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1064 transitions. [2024-11-10 17:37:57,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:37:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1064 transitions. [2024-11-10 17:37:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 17:37:57,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:37:57,728 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:37:57,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-11-10 17:37:57,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:57,933 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:37:57,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:37:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash -871763027, now seen corresponding path program 5 times [2024-11-10 17:37:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:37:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056664916] [2024-11-10 17:37:57,933 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:37:57,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:37:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:37:57,936 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:37:57,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-10 17:37:58,949 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:37:58,949 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:37:58,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-10 17:37:58,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:37:59,002 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-11-10 17:37:59,099 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:37:59,099 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-11-10 17:37:59,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:37:59,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:37:59,132 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-11-10 17:37:59,202 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 22 treesize of output 10 [2024-11-10 17:37:59,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-10 17:37:59,749 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:37:59,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:37:59,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 13 [2024-11-10 17:37:59,779 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 31 treesize of output 13 [2024-11-10 17:37:59,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-10 17:37:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:37:59,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:38:00,658 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-10 17:38:00,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:38:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056664916] [2024-11-10 17:38:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056664916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1863457797] [2024-11-10 17:38:00,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:38:00,669 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:38:00,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:38:00,671 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:38:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process