./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-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_OAT_test3-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 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:35:00,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:35:00,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:35:00,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:35:00,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:35:00,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:35:00,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:35:00,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:35:00,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:35:00,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:35:00,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:35:00,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:35:00,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:35:00,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:35:00,274 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:35:00,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:35:00,275 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:35:00,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:35:00,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:35:00,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:35:00,276 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:35:00,276 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:35:00,276 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:35:00,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:35:00,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:35:00,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:35:00,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:35:00,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:35:00,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:35:00,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:35:00,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:35:00,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:35:00,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:35:00,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:35:00,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:35:00,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:35:00,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:35:00,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:35:00,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:35:00,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:35:00,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:35:00,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:35:00,279 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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2024-11-10 17:35:00,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:35:00,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:35:00,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:35:00,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:35:00,493 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:35:00,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2024-11-10 17:35:01,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:35:01,947 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:35:01,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2024-11-10 17:35:01,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8936e8a/eb8832100d8947e5ae2fe6608a19daaf/FLAGa61a5b370 [2024-11-10 17:35:01,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8936e8a/eb8832100d8947e5ae2fe6608a19daaf [2024-11-10 17:35:01,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:35:01,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:35:01,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:35:01,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:35:01,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:35:01,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:01" (1/1) ... [2024-11-10 17:35:01,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4739d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:01, skipping insertion in model container [2024-11-10 17:35:01,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:01" (1/1) ... [2024-11-10 17:35:02,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:35:02,357 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:35:02,389 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:35:02,392 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:35:02,397 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:35:02,412 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:35:02,439 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:35:02,439 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:35:02,441 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:35:02,441 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:35:02,445 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:35:02,446 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:35:02,449 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:35:02,450 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:35:02,452 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:35:02,453 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:35:02,454 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:35:02,455 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:35:02,455 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:35:02,456 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:35:02,458 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:35:02,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:35:02,471 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:35:02,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60f05b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:02, skipping insertion in model container [2024-11-10 17:35:02,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:35:02,474 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:35:02,478 INFO L158 Benchmark]: Toolchain (without parser) took 497.03ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 57.3MB in the beginning and 130.7MB in the end (delta: -73.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-10 17:35:02,479 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:35:02,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.08ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 57.3MB in the beginning and 130.7MB in the end (delta: -73.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-10 17:35:02,481 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.08ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 57.3MB in the beginning and 130.7MB in the end (delta: -73.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: 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_OAT_test3-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 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:35:04,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:35:04,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:35:04,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:35:04,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:35:04,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:35:04,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:35:04,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:35:04,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:35:04,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:35:04,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:35:04,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:35:04,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:35:04,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:35:04,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:35:04,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:35:04,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:35:04,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:35:04,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:35:04,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:35:04,127 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:35:04,127 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:35:04,127 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:35:04,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:35:04,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:35:04,128 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:35:04,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:35:04,128 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:35:04,129 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:35:04,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:35:04,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:35:04,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:35:04,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:35:04,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:35:04,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:35:04,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:35:04,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:35:04,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:35:04,131 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:35:04,131 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:35:04,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:35:04,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:35:04,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:35:04,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:35:04,132 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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2024-11-10 17:35:04,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:35:04,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:35:04,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:35:04,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:35:04,391 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:35:04,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2024-11-10 17:35:05,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:35:05,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:35:05,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2024-11-10 17:35:05,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2a99ab3/bf3acb6eaf664d81aef61bc3c3af05fe/FLAG077b75b22 [2024-11-10 17:35:06,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2a99ab3/bf3acb6eaf664d81aef61bc3c3af05fe [2024-11-10 17:35:06,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:35:06,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:35:06,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:35:06,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:35:06,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:35:06,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:06,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf26a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06, skipping insertion in model container [2024-11-10 17:35:06,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:06,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:35:06,595 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:35:06,625 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:35:06,628 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:35:06,631 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:35:06,636 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:35:06,671 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:35:06,673 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:35:06,675 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:35:06,677 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:35:06,679 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:35:06,684 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:35:06,685 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:35:06,686 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:35:06,692 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:35:06,693 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:35:06,694 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:35:06,695 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:35:06,698 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:35:06,698 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:35:06,700 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:35:06,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:35:06,729 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:35:06,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:35:06,766 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:35:06,781 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:35:06,783 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:35:06,784 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:35:06,787 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:35:06,797 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:35:06,798 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:35:06,799 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:35:06,799 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:35:06,801 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:35:06,801 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:35:06,802 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:35:06,802 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:35:06,805 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:35:06,805 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:35:06,806 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:35:06,807 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:35:06,807 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:35:06,807 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:35:06,809 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:35:06,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:35:06,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:35:06,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:35:06,912 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:35:06,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06 WrapperNode [2024-11-10 17:35:06,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:35:06,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:35:06,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:35:06,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:35:06,918 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:35:06" (1/1) ... [2024-11-10 17:35:06,944 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:35:06" (1/1) ... [2024-11-10 17:35:06,993 INFO L138 Inliner]: procedures = 180, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1196 [2024-11-10 17:35:06,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:35:06,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:35:06,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:35:06,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:35:07,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,079 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-10 17:35:07,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:35:07,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:35:07,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:35:07,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:35:07,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (1/1) ... [2024-11-10 17:35:07,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:35:07,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:35:07,172 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:35:07,174 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:35:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:35:07,203 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:35:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:35:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:35:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 17:35:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:35:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:35:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 17:35:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:35:07,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:35:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:35:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:35:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:35:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:35:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:35:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:35:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:35:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:35:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:35:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 17:35:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:35:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:35:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 17:35:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:35:07,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:35:07,394 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:35:07,395 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:35:10,112 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: 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:35:10,208 INFO L? ?]: Removed 1312 outVars from TransFormulas that were not future-live. [2024-11-10 17:35:10,208 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:35:10,238 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:35:10,242 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:35:10,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:35:10 BoogieIcfgContainer [2024-11-10 17:35:10,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:35:10,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:35:10,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:35:10,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:35:10,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:35:06" (1/3) ... [2024-11-10 17:35:10,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b27ee26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:35:10, skipping insertion in model container [2024-11-10 17:35:10,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:06" (2/3) ... [2024-11-10 17:35:10,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b27ee26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:35:10, skipping insertion in model container [2024-11-10 17:35:10,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:35:10" (3/3) ... [2024-11-10 17:35:10,250 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-2.i [2024-11-10 17:35:10,263 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:35:10,263 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 632 error locations. [2024-11-10 17:35:10,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:35:10,329 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;@14323d86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:35:10,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 632 error locations. [2024-11-10 17:35:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 1308 states, 665 states have (on average 2.169924812030075) internal successors, (1443), 1301 states have internal predecessors, (1443), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 17:35:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:35:10,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:10,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:35:10,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr629REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1492446, now seen corresponding path program 1 times [2024-11-10 17:35:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933116246] [2024-11-10 17:35:10,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:10,351 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:35:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:10,353 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:35:10,354 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:35:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:10,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:35:10,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:10,520 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:35:10,531 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:35:10,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:10,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:10,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933116246] [2024-11-10 17:35:10,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933116246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:10,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:10,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:35:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389285791] [2024-11-10 17:35:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:10,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:10,600 INFO L87 Difference]: Start difference. First operand has 1308 states, 665 states have (on average 2.169924812030075) internal successors, (1443), 1301 states have internal predecessors, (1443), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:35:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:11,956 INFO L93 Difference]: Finished difference Result 1488 states and 1574 transitions. [2024-11-10 17:35:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:11,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-10 17:35:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:11,971 INFO L225 Difference]: With dead ends: 1488 [2024-11-10 17:35:11,971 INFO L226 Difference]: Without dead ends: 1485 [2024-11-10 17:35:11,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:35:11,974 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 1201 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:11,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 976 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:35:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-10 17:35:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1291. [2024-11-10 17:35:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 665 states have (on average 2.030075187969925) internal successors, (1350), 1284 states have internal predecessors, (1350), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1368 transitions. [2024-11-10 17:35:12,035 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1368 transitions. Word has length 3 [2024-11-10 17:35:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:12,036 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1368 transitions. [2024-11-10 17:35:12,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:35:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1368 transitions. [2024-11-10 17:35:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:35:12,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:12,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:35:12,040 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:35:12,238 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:35:12,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr630REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:12,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:12,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1492447, now seen corresponding path program 1 times [2024-11-10 17:35:12,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:12,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835324924] [2024-11-10 17:35:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:12,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:35:12,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:12,243 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:35:12,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:35:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:12,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:35:12,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:12,349 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:35:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:35:12,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:12,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835324924] [2024-11-10 17:35:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835324924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:12,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:12,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:35:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355098409] [2024-11-10 17:35:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:12,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:12,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:12,360 INFO L87 Difference]: Start difference. First operand 1291 states and 1368 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:35:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:14,182 INFO L93 Difference]: Finished difference Result 1931 states and 2061 transitions. [2024-11-10 17:35:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:14,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-10 17:35:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:14,187 INFO L225 Difference]: With dead ends: 1931 [2024-11-10 17:35:14,187 INFO L226 Difference]: Without dead ends: 1931 [2024-11-10 17:35:14,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:35:14,188 INFO L432 NwaCegarLoop]: 1073 mSDtfsCounter, 681 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:14,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1813 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:35:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2024-11-10 17:35:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1513. [2024-11-10 17:35:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 888 states have (on average 2.0112612612612613) internal successors, (1786), 1506 states have internal predecessors, (1786), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1804 transitions. [2024-11-10 17:35:14,214 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1804 transitions. Word has length 3 [2024-11-10 17:35:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:14,214 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1804 transitions. [2024-11-10 17:35:14,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:35:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1804 transitions. [2024-11-10 17:35:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:35:14,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:14,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:14,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 17:35:14,417 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:35:14,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:14,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1796491749, now seen corresponding path program 1 times [2024-11-10 17:35:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64760473] [2024-11-10 17:35:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:14,419 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:35:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:14,421 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:35:14,422 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:35:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:14,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:35:14,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:14,541 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:35:14,546 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:35:14,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:35:14,605 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:35:14,618 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:35:14,619 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:35:14,636 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:35:14,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:14,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64760473] [2024-11-10 17:35:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64760473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:14,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337161276] [2024-11-10 17:35:14,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:14,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:14,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:14,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:14,638 INFO L87 Difference]: Start difference. First operand 1513 states and 1804 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:35:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:16,656 INFO L93 Difference]: Finished difference Result 1702 states and 2004 transitions. [2024-11-10 17:35:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:35:16,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-10 17:35:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:16,661 INFO L225 Difference]: With dead ends: 1702 [2024-11-10 17:35:16,661 INFO L226 Difference]: Without dead ends: 1702 [2024-11-10 17:35:16,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:35:16,662 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 2693 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:16,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2701 Valid, 587 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:35:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-11-10 17:35:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1279. [2024-11-10 17:35:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 665 states have (on average 2.0105263157894737) internal successors, (1337), 1272 states have internal predecessors, (1337), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1355 transitions. [2024-11-10 17:35:16,684 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1355 transitions. Word has length 8 [2024-11-10 17:35:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:16,684 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1355 transitions. [2024-11-10 17:35:16,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:35:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1355 transitions. [2024-11-10 17:35:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:35:16,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:16,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:16,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 17:35:16,888 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:35:16,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash 143332020, now seen corresponding path program 1 times [2024-11-10 17:35:16,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:16,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463140750] [2024-11-10 17:35:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:16,890 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:35:16,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:16,892 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:35:16,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 17:35:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:16,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:35:16,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:16,998 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:35:17,006 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:35:17,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:17,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:17,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463140750] [2024-11-10 17:35:17,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463140750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:17,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:35:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706136070] [2024-11-10 17:35:17,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:17,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:17,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:17,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:17,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:17,007 INFO L87 Difference]: Start difference. First operand 1279 states and 1355 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:35:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:18,245 INFO L93 Difference]: Finished difference Result 1625 states and 1731 transitions. [2024-11-10 17:35:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:18,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:35:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:18,250 INFO L225 Difference]: With dead ends: 1625 [2024-11-10 17:35:18,250 INFO L226 Difference]: Without dead ends: 1625 [2024-11-10 17:35:18,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:35:18,250 INFO L432 NwaCegarLoop]: 1222 mSDtfsCounter, 961 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:18,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1589 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:35:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-10 17:35:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1230. [2024-11-10 17:35:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 665 states have (on average 1.936842105263158) internal successors, (1288), 1223 states have internal predecessors, (1288), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1306 transitions. [2024-11-10 17:35:18,265 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1306 transitions. Word has length 9 [2024-11-10 17:35:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:18,265 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1306 transitions. [2024-11-10 17:35:18,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:35:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1306 transitions. [2024-11-10 17:35:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:35:18,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:18,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:18,272 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:35:18,466 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:35:18,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash 143332021, now seen corresponding path program 1 times [2024-11-10 17:35:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26288907] [2024-11-10 17:35:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:18,468 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:35:18,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:18,469 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:35:18,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 (6)] Waiting until timeout for monitored process [2024-11-10 17:35:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:18,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:35:18,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:18,564 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:35:18,591 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:35:18,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:18,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:18,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26288907] [2024-11-10 17:35:18,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26288907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:18,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:18,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:35:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098288675] [2024-11-10 17:35:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:18,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:18,592 INFO L87 Difference]: Start difference. First operand 1230 states and 1306 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:35:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:20,068 INFO L93 Difference]: Finished difference Result 1717 states and 1826 transitions. [2024-11-10 17:35:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:20,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:35:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:20,073 INFO L225 Difference]: With dead ends: 1717 [2024-11-10 17:35:20,073 INFO L226 Difference]: Without dead ends: 1717 [2024-11-10 17:35:20,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:35:20,074 INFO L432 NwaCegarLoop]: 1421 mSDtfsCounter, 710 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:20,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1998 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:35:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-11-10 17:35:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1259. [2024-11-10 17:35:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 704 states have (on average 1.9232954545454546) internal successors, (1354), 1252 states have internal predecessors, (1354), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1372 transitions. [2024-11-10 17:35:20,092 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1372 transitions. Word has length 9 [2024-11-10 17:35:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:20,093 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1372 transitions. [2024-11-10 17:35:20,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:35:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1372 transitions. [2024-11-10 17:35:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 17:35:20,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:20,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:20,097 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 (6)] Forceful destruction successful, exit code 0 [2024-11-10 17:35:20,294 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:35:20,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:20,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1628973646, now seen corresponding path program 1 times [2024-11-10 17:35:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065241869] [2024-11-10 17:35:20,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:20,295 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:35:20,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:20,298 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:35:20,298 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:35:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:20,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:35:20,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:20,454 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:35:20,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:20,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065241869] [2024-11-10 17:35:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065241869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464084196] [2024-11-10 17:35:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:20,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:20,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:20,456 INFO L87 Difference]: Start difference. First operand 1259 states and 1372 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:35:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:20,914 INFO L93 Difference]: Finished difference Result 1877 states and 2074 transitions. [2024-11-10 17:35:20,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:35:20,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:35:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:20,920 INFO L225 Difference]: With dead ends: 1877 [2024-11-10 17:35:20,920 INFO L226 Difference]: Without dead ends: 1877 [2024-11-10 17:35:20,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:35:20,921 INFO L432 NwaCegarLoop]: 1429 mSDtfsCounter, 652 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 3914 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:20,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 3914 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 17:35:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-11-10 17:35:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1518. [2024-11-10 17:35:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 963 states have (on average 1.8982346832814123) internal successors, (1828), 1511 states have internal predecessors, (1828), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1846 transitions. [2024-11-10 17:35:20,937 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1846 transitions. Word has length 14 [2024-11-10 17:35:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:20,938 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1846 transitions. [2024-11-10 17:35:20,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:35:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1846 transitions. [2024-11-10 17:35:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 17:35:20,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:20,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:20,942 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:35:21,141 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:35:21,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:21,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash -346273135, now seen corresponding path program 1 times [2024-11-10 17:35:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:21,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672543592] [2024-11-10 17:35:21,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:21,142 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:35:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:21,143 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:35:21,144 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:35:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:21,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:35:21,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:21,251 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:35:21,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:21,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:21,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672543592] [2024-11-10 17:35:21,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672543592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:21,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:21,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:21,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913440595] [2024-11-10 17:35:21,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:21,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:21,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:21,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:21,254 INFO L87 Difference]: Start difference. First operand 1518 states and 1846 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:35:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:21,275 INFO L93 Difference]: Finished difference Result 1458 states and 1760 transitions. [2024-11-10 17:35:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:21,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-10 17:35:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:21,278 INFO L225 Difference]: With dead ends: 1458 [2024-11-10 17:35:21,278 INFO L226 Difference]: Without dead ends: 1458 [2024-11-10 17:35:21,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:35:21,279 INFO L432 NwaCegarLoop]: 1233 mSDtfsCounter, 71 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2402 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:35:21,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2402 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-11-10 17:35:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2024-11-10 17:35:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 927 states have (on average 1.8791801510248112) internal successors, (1742), 1451 states have internal predecessors, (1742), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1760 transitions. [2024-11-10 17:35:21,295 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1760 transitions. Word has length 16 [2024-11-10 17:35:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 1760 transitions. [2024-11-10 17:35:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:35:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1760 transitions. [2024-11-10 17:35:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 17:35:21,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:21,296 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:35:21,300 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:35:21,496 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:35:21,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr275REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:21,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:21,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2056049403, now seen corresponding path program 1 times [2024-11-10 17:35:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715007692] [2024-11-10 17:35:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:21,498 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:35:21,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:21,499 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:35:21,500 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:35:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:21,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:35:21,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:21,607 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:35:21,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:21,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715007692] [2024-11-10 17:35:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715007692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:21,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490363351] [2024-11-10 17:35:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:21,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:21,608 INFO L87 Difference]: Start difference. First operand 1458 states and 1760 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:35:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:21,663 INFO L93 Difference]: Finished difference Result 1428 states and 1702 transitions. [2024-11-10 17:35:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:35:21,663 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:35:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:21,666 INFO L225 Difference]: With dead ends: 1428 [2024-11-10 17:35:21,666 INFO L226 Difference]: Without dead ends: 1428 [2024-11-10 17:35:21,667 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:35:21,667 INFO L432 NwaCegarLoop]: 1188 mSDtfsCounter, 48 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3537 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:35:21,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3537 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-10 17:35:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2024-11-10 17:35:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 911 states have (on average 1.8485181119648737) internal successors, (1684), 1421 states have internal predecessors, (1684), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1702 transitions. [2024-11-10 17:35:21,681 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1702 transitions. Word has length 18 [2024-11-10 17:35:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:21,681 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1702 transitions. [2024-11-10 17:35:21,681 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:35:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1702 transitions. [2024-11-10 17:35:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 17:35:21,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:21,682 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] [2024-11-10 17:35:21,685 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:35:21,885 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:35:21,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr615REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 49793037, now seen corresponding path program 1 times [2024-11-10 17:35:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:21,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164121585] [2024-11-10 17:35:21,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:21,886 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:35:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:21,888 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:35:21,889 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:35:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:22,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:35:22,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:22,009 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:35:22,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:22,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:22,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164121585] [2024-11-10 17:35:22,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164121585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:22,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579567755] [2024-11-10 17:35:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:22,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:22,010 INFO L87 Difference]: Start difference. First operand 1428 states and 1702 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:35:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:22,030 INFO L93 Difference]: Finished difference Result 1368 states and 1616 transitions. [2024-11-10 17:35:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-10 17:35:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:22,033 INFO L225 Difference]: With dead ends: 1368 [2024-11-10 17:35:22,033 INFO L226 Difference]: Without dead ends: 1368 [2024-11-10 17:35:22,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:35:22,034 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 71 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2246 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:35:22,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2246 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-10 17:35:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1368. [2024-11-10 17:35:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 875 states have (on average 1.8262857142857143) internal successors, (1598), 1361 states have internal predecessors, (1598), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1616 transitions. [2024-11-10 17:35:22,047 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1616 transitions. Word has length 20 [2024-11-10 17:35:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:22,047 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 1616 transitions. [2024-11-10 17:35:22,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:35:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1616 transitions. [2024-11-10 17:35:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 17:35:22,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:22,048 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:35:22,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 17:35:22,248 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:35:22,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1947032309, now seen corresponding path program 1 times [2024-11-10 17:35:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946971353] [2024-11-10 17:35:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:22,249 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:35:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:22,250 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:35:22,251 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:35:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:22,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:35:22,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:22,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:35:22,380 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:35:22,380 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:35:22,382 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:35:22,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:35:22,427 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:35:22,435 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:35:22,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:22,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:22,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946971353] [2024-11-10 17:35:22,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946971353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:22,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:22,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:22,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800759468] [2024-11-10 17:35:22,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:22,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:22,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:22,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:22,437 INFO L87 Difference]: Start difference. First operand 1368 states and 1616 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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:35:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:22,610 INFO L93 Difference]: Finished difference Result 2429 states and 2809 transitions. [2024-11-10 17:35:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:35:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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:35:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:22,615 INFO L225 Difference]: With dead ends: 2429 [2024-11-10 17:35:22,615 INFO L226 Difference]: Without dead ends: 2429 [2024-11-10 17:35:22,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:35:22,616 INFO L432 NwaCegarLoop]: 1149 mSDtfsCounter, 1083 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 3432 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:22,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 3432 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:35:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2024-11-10 17:35:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1367. [2024-11-10 17:35:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 874 states have (on average 1.826086956521739) internal successors, (1596), 1360 states have internal predecessors, (1596), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1614 transitions. [2024-11-10 17:35:22,631 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1614 transitions. Word has length 21 [2024-11-10 17:35:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:22,631 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1614 transitions. [2024-11-10 17:35:22,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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:35:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1614 transitions. [2024-11-10 17:35:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 17:35:22,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:22,632 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] [2024-11-10 17:35:22,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 17:35:22,832 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:35:22,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr591REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 606441473, now seen corresponding path program 1 times [2024-11-10 17:35:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661347701] [2024-11-10 17:35:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:22,834 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:35:22,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:22,835 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:35:22,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 (12)] Waiting until timeout for monitored process [2024-11-10 17:35:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:22,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:35:22,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:22,976 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:35:22,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:22,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661347701] [2024-11-10 17:35:22,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661347701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:22,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:22,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:22,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213080390] [2024-11-10 17:35:22,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:22,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:22,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:22,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:22,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:22,977 INFO L87 Difference]: Start difference. First operand 1367 states and 1614 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:35:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:23,032 INFO L93 Difference]: Finished difference Result 1337 states and 1556 transitions. [2024-11-10 17:35:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:35:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-10 17:35:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:23,036 INFO L225 Difference]: With dead ends: 1337 [2024-11-10 17:35:23,036 INFO L226 Difference]: Without dead ends: 1337 [2024-11-10 17:35:23,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:35:23,037 INFO L432 NwaCegarLoop]: 1110 mSDtfsCounter, 48 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3303 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:35:23,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3303 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2024-11-10 17:35:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1337. [2024-11-10 17:35:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 858 states have (on average 1.7925407925407926) internal successors, (1538), 1330 states have internal predecessors, (1538), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1556 transitions. [2024-11-10 17:35:23,049 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1556 transitions. Word has length 22 [2024-11-10 17:35:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1556 transitions. [2024-11-10 17:35:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:35:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1556 transitions. [2024-11-10 17:35:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 17:35:23,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:23,051 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] [2024-11-10 17:35:23,062 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:35:23,252 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:35:23,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr577REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2096241655, now seen corresponding path program 1 times [2024-11-10 17:35:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:23,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459817468] [2024-11-10 17:35:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:23,253 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:35:23,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:23,254 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:35:23,255 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:35:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:23,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:35:23,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:23,382 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:35:23,438 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:35:23,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:23,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459817468] [2024-11-10 17:35:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459817468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814221876] [2024-11-10 17:35:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:23,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:23,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:23,439 INFO L87 Difference]: Start difference. First operand 1337 states and 1556 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:35:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:24,772 INFO L93 Difference]: Finished difference Result 1748 states and 2080 transitions. [2024-11-10 17:35:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:35:24,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-10 17:35:24,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:24,776 INFO L225 Difference]: With dead ends: 1748 [2024-11-10 17:35:24,776 INFO L226 Difference]: Without dead ends: 1748 [2024-11-10 17:35:24,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:35:24,777 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 816 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:24,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1598 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:35:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-11-10 17:35:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1333. [2024-11-10 17:35:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 858 states have (on average 1.7832167832167831) internal successors, (1530), 1326 states have internal predecessors, (1530), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1548 transitions. [2024-11-10 17:35:24,789 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1548 transitions. Word has length 36 [2024-11-10 17:35:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:24,789 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1548 transitions. [2024-11-10 17:35:24,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:35:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1548 transitions. [2024-11-10 17:35:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 17:35:24,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:24,790 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] [2024-11-10 17:35:24,795 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:35:24,990 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:35:24,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr578REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:24,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2096241656, now seen corresponding path program 1 times [2024-11-10 17:35:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:24,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348512082] [2024-11-10 17:35:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:24,992 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:35:24,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:24,994 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:35:24,995 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:35:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:25,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:35:25,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:25,143 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:35:25,263 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:35:25,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:25,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348512082] [2024-11-10 17:35:25,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348512082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:25,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:25,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:25,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419854036] [2024-11-10 17:35:25,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:25,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:25,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:25,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:25,266 INFO L87 Difference]: Start difference. First operand 1333 states and 1548 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:35:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:26,980 INFO L93 Difference]: Finished difference Result 1867 states and 2176 transitions. [2024-11-10 17:35:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:35:26,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-10 17:35:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:26,985 INFO L225 Difference]: With dead ends: 1867 [2024-11-10 17:35:26,985 INFO L226 Difference]: Without dead ends: 1867 [2024-11-10 17:35:26,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:35:26,986 INFO L432 NwaCegarLoop]: 1350 mSDtfsCounter, 561 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:26,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 2736 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:35:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2024-11-10 17:35:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1329. [2024-11-10 17:35:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 858 states have (on average 1.7738927738927739) internal successors, (1522), 1322 states have internal predecessors, (1522), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1540 transitions. [2024-11-10 17:35:26,998 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1540 transitions. Word has length 36 [2024-11-10 17:35:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:26,999 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1540 transitions. [2024-11-10 17:35:26,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:35:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1540 transitions. [2024-11-10 17:35:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 17:35:27,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:27,000 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] [2024-11-10 17:35:27,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 17:35:27,200 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:35:27,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:27,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1769108430, now seen corresponding path program 1 times [2024-11-10 17:35:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:27,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510391155] [2024-11-10 17:35:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:27,202 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:35:27,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:27,203 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:35:27,204 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:35:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:27,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:35:27,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:27,404 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:35:27,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:27,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:27,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510391155] [2024-11-10 17:35:27,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510391155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:27,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:27,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177139041] [2024-11-10 17:35:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:27,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:27,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:27,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:27,405 INFO L87 Difference]: Start difference. First operand 1329 states and 1540 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:35:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:27,453 INFO L93 Difference]: Finished difference Result 1317 states and 1520 transitions. [2024-11-10 17:35:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:35:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-11-10 17:35:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:27,456 INFO L225 Difference]: With dead ends: 1317 [2024-11-10 17:35:27,456 INFO L226 Difference]: Without dead ends: 1317 [2024-11-10 17:35:27,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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:35:27,456 INFO L432 NwaCegarLoop]: 1104 mSDtfsCounter, 21 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3280 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:35:27,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3280 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-11-10 17:35:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2024-11-10 17:35:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 846 states have (on average 1.7754137115839244) internal successors, (1502), 1310 states have internal predecessors, (1502), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1520 transitions. [2024-11-10 17:35:27,467 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1520 transitions. Word has length 56 [2024-11-10 17:35:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:27,467 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1520 transitions. [2024-11-10 17:35:27,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:35:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1520 transitions. [2024-11-10 17:35:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 17:35:27,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:27,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:27,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-10 17:35:27,669 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:35:27,669 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash -998117638, now seen corresponding path program 1 times [2024-11-10 17:35:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602407413] [2024-11-10 17:35:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:27,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:35:27,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:27,672 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:35:27,672 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:35:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:27,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:35:27,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:27,922 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:35:27,929 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:35:28,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:35:28,283 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:35:28,291 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:35:28,291 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:35:28,298 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:35:28,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:28,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:28,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602407413] [2024-11-10 17:35:28,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602407413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:28,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382818436] [2024-11-10 17:35:28,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:28,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:28,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:28,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:28,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:28,300 INFO L87 Difference]: Start difference. First operand 1317 states and 1520 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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:35:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:29,662 INFO L93 Difference]: Finished difference Result 1686 states and 2006 transitions. [2024-11-10 17:35:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:35:29,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-10 17:35:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:29,670 INFO L225 Difference]: With dead ends: 1686 [2024-11-10 17:35:29,670 INFO L226 Difference]: Without dead ends: 1686 [2024-11-10 17:35:29,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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:35:29,671 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 1799 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:29,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 852 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:35:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-10 17:35:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1240. [2024-11-10 17:35:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 807 states have (on average 1.7199504337050806) internal successors, (1388), 1233 states have internal predecessors, (1388), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1406 transitions. [2024-11-10 17:35:29,681 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1406 transitions. Word has length 64 [2024-11-10 17:35:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:29,682 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1406 transitions. [2024-11-10 17:35:29,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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:35:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1406 transitions. [2024-11-10 17:35:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 17:35:29,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:29,684 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] [2024-11-10 17:35:29,692 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:35:29,884 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:35:29,885 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:29,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash -225652527, now seen corresponding path program 1 times [2024-11-10 17:35:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:29,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877865864] [2024-11-10 17:35:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:29,886 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:35:29,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:29,888 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:35:29,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 17:35:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:30,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:35:30,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:30,094 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:35:30,108 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:35:30,127 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:35:30,134 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:35:30,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:30,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:30,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877865864] [2024-11-10 17:35:30,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877865864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:30,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:30,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504956129] [2024-11-10 17:35:30,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:30,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:35:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:35:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:35:30,135 INFO L87 Difference]: Start difference. First operand 1240 states and 1406 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:35:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:31,558 INFO L93 Difference]: Finished difference Result 1239 states and 1405 transitions. [2024-11-10 17:35:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:35:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-10 17:35:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:31,561 INFO L225 Difference]: With dead ends: 1239 [2024-11-10 17:35:31,561 INFO L226 Difference]: Without dead ends: 1239 [2024-11-10 17:35:31,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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:35:31,561 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 2 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:31,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2815 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:35:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-11-10 17:35:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2024-11-10 17:35:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 807 states have (on average 1.7187112763320942) internal successors, (1387), 1232 states have internal predecessors, (1387), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1405 transitions. [2024-11-10 17:35:31,571 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1405 transitions. Word has length 69 [2024-11-10 17:35:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:31,571 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1405 transitions. [2024-11-10 17:35:31,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:35:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1405 transitions. [2024-11-10 17:35:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 17:35:31,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:31,571 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] [2024-11-10 17:35:31,580 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 (17)] Ended with exit code 0 [2024-11-10 17:35:31,772 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:35:31,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr528REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:31,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash -225652526, now seen corresponding path program 1 times [2024-11-10 17:35:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:31,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767977887] [2024-11-10 17:35:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:31,773 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:35:31,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:31,775 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:35:31,776 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:35:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:31,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 17:35:31,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:31,984 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:35:31,998 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:35:32,001 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:35:32,031 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:35:32,043 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:35:32,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:32,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:32,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767977887] [2024-11-10 17:35:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767977887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:32,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974461277] [2024-11-10 17:35:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:32,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:35:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:32,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:35:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:35:32,045 INFO L87 Difference]: Start difference. First operand 1239 states and 1405 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:35:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:33,671 INFO L93 Difference]: Finished difference Result 1238 states and 1404 transitions. [2024-11-10 17:35:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:35:33,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-10 17:35:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:33,674 INFO L225 Difference]: With dead ends: 1238 [2024-11-10 17:35:33,674 INFO L226 Difference]: Without dead ends: 1238 [2024-11-10 17:35:33,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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:35:33,674 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 1 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:33,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2885 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:35:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-11-10 17:35:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2024-11-10 17:35:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 806 states have (on average 1.7196029776674937) internal successors, (1386), 1231 states have internal predecessors, (1386), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:35:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1404 transitions. [2024-11-10 17:35:33,683 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1404 transitions. Word has length 69 [2024-11-10 17:35:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:33,683 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1404 transitions. [2024-11-10 17:35:33,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:35:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1404 transitions. [2024-11-10 17:35:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 17:35:33,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:33,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:33,692 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:35:33,884 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:35:33,885 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:33,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2037606574, now seen corresponding path program 1 times [2024-11-10 17:35:33,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:33,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048002896] [2024-11-10 17:35:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:33,886 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:35:33,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:33,888 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:35:33,889 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:35:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:34,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:35:34,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:34,099 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:35:34,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:34,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048002896] [2024-11-10 17:35:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048002896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:34,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499680143] [2024-11-10 17:35:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:34,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:34,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:34,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:34,100 INFO L87 Difference]: Start difference. First operand 1238 states and 1404 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:35:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:34,132 INFO L93 Difference]: Finished difference Result 1241 states and 1408 transitions. [2024-11-10 17:35:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:35:34,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 77 [2024-11-10 17:35:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:34,135 INFO L225 Difference]: With dead ends: 1241 [2024-11-10 17:35:34,135 INFO L226 Difference]: Without dead ends: 1241 [2024-11-10 17:35:34,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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:35:34,136 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 0 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3226 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:35:34,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3226 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-10 17:35:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2024-11-10 17:35:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 808 states have (on average 1.7190594059405941) internal successors, (1389), 1234 states have internal predecessors, (1389), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:35:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1408 transitions. [2024-11-10 17:35:34,148 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1408 transitions. Word has length 77 [2024-11-10 17:35:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:34,148 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1408 transitions. [2024-11-10 17:35:34,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:35:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1408 transitions. [2024-11-10 17:35:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:35:34,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:34,149 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:35:34,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 17:35:34,350 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:35:34,351 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 697016905, now seen corresponding path program 1 times [2024-11-10 17:35:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84856720] [2024-11-10 17:35:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:34,352 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:35:34,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:34,353 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:35:34,354 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:35:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:34,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:35:34,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:34,609 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:35:34,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:35:34,650 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:35:34,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:34,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84856720] [2024-11-10 17:35:34,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84856720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:35:34,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:35:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:35:34,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340824495] [2024-11-10 17:35:34,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:35:34,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:35:34,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:35:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:35:34,652 INFO L87 Difference]: Start difference. First operand 1241 states and 1408 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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:35:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:34,731 INFO L93 Difference]: Finished difference Result 1253 states and 1425 transitions. [2024-11-10 17:35:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:35:34,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 78 [2024-11-10 17:35:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:34,734 INFO L225 Difference]: With dead ends: 1253 [2024-11-10 17:35:34,734 INFO L226 Difference]: Without dead ends: 1253 [2024-11-10 17:35:34,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:35:34,735 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 6 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3228 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:34,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3228 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:35:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-11-10 17:35:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1251. [2024-11-10 17:35:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 817 states have (on average 1.718482252141983) internal successors, (1404), 1243 states have internal predecessors, (1404), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:35:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1423 transitions. [2024-11-10 17:35:34,746 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1423 transitions. Word has length 78 [2024-11-10 17:35:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:34,746 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1423 transitions. [2024-11-10 17:35:34,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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:35:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1423 transitions. [2024-11-10 17:35:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 17:35:34,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:34,747 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] [2024-11-10 17:35:34,754 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:35:34,950 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:35:34,951 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:34,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -628983954, now seen corresponding path program 2 times [2024-11-10 17:35:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:34,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473566574] [2024-11-10 17:35:34,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:35:34,952 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:35:34,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:34,953 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:35:34,953 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:35:35,283 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:35:35,283 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:35:35,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:35:35,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:35,327 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:35:35,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:35:35,433 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:35:35,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473566574] [2024-11-10 17:35:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473566574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:35:35,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:35:35,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:35:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178129668] [2024-11-10 17:35:35,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:35:35,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:35:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:35:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:35:35,435 INFO L87 Difference]: Start difference. First operand 1251 states and 1423 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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:35:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:35,708 INFO L93 Difference]: Finished difference Result 1266 states and 1445 transitions. [2024-11-10 17:35:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:35:35,708 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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 81 [2024-11-10 17:35:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:35,710 INFO L225 Difference]: With dead ends: 1266 [2024-11-10 17:35:35,710 INFO L226 Difference]: Without dead ends: 1262 [2024-11-10 17:35:35,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:35:35,711 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 14 mSDsluCounter, 5373 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6450 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:35,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6450 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:35:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-11-10 17:35:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1260. [2024-11-10 17:35:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 826 states have (on average 1.7142857142857142) internal successors, (1416), 1252 states have internal predecessors, (1416), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:35:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1435 transitions. [2024-11-10 17:35:35,722 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1435 transitions. Word has length 81 [2024-11-10 17:35:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:35,723 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1435 transitions. [2024-11-10 17:35:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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:35:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1435 transitions. [2024-11-10 17:35:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 17:35:35,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:35,723 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] [2024-11-10 17:35:35,732 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 (21)] Ended with exit code 0 [2024-11-10 17:35:35,924 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:35:35,924 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:35,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:35,924 INFO L85 PathProgramCache]: Analyzing trace with hash 867826062, now seen corresponding path program 3 times [2024-11-10 17:35:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:35,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106608903] [2024-11-10 17:35:35,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:35:35,925 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:35:35,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:35,926 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:35:35,927 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:35:36,400 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:35:36,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:35:36,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:35:36,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:36,510 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:35:36,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:35:36,835 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:35:36,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106608903] [2024-11-10 17:35:36,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106608903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:35:36,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:35:36,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:35:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032368611] [2024-11-10 17:35:36,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:35:36,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:35:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:36,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:35:36,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:35:36,837 INFO L87 Difference]: Start difference. First operand 1260 states and 1435 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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:35:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:37,904 INFO L93 Difference]: Finished difference Result 1284 states and 1474 transitions. [2024-11-10 17:35:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:35:37,905 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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 87 [2024-11-10 17:35:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:37,906 INFO L225 Difference]: With dead ends: 1284 [2024-11-10 17:35:37,907 INFO L226 Difference]: Without dead ends: 1278 [2024-11-10 17:35:37,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:35:37,907 INFO L432 NwaCegarLoop]: 1078 mSDtfsCounter, 19 mSDsluCounter, 13969 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 15047 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:37,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 15047 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 17:35:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-11-10 17:35:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1278. [2024-11-10 17:35:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 844 states have (on average 1.7049763033175356) internal successors, (1439), 1270 states have internal predecessors, (1439), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:35:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1458 transitions. [2024-11-10 17:35:37,917 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1458 transitions. Word has length 87 [2024-11-10 17:35:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:37,918 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1458 transitions. [2024-11-10 17:35:37,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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:35:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1458 transitions. [2024-11-10 17:35:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:35:37,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:37,918 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] [2024-11-10 17:35:37,929 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:35:38,119 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:35:38,119 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:38,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1493912114, now seen corresponding path program 4 times [2024-11-10 17:35:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828922786] [2024-11-10 17:35:38,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:35:38,120 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:35:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:38,121 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:35:38,122 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:35:38,471 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:35:38,471 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:35:38,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:35:38,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:38,723 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:35:38,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:35:39,613 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:35:39,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828922786] [2024-11-10 17:35:39,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828922786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:35:39,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:35:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:35:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946303974] [2024-11-10 17:35:39,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:35:39,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:35:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:35:39,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:35:39,616 INFO L87 Difference]: Start difference. First operand 1278 states and 1458 transitions. Second operand has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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:35:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:43,392 INFO L93 Difference]: Finished difference Result 1318 states and 1530 transitions. [2024-11-10 17:35:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:35:43,392 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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 99 [2024-11-10 17:35:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:43,394 INFO L225 Difference]: With dead ends: 1318 [2024-11-10 17:35:43,394 INFO L226 Difference]: Without dead ends: 1314 [2024-11-10 17:35:43,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:35:43,396 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 31 mSDsluCounter, 25778 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 26855 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:43,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 26855 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:35:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-10 17:35:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1312. [2024-11-10 17:35:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 878 states have (on average 1.6913439635535308) internal successors, (1485), 1304 states have internal predecessors, (1485), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 17:35:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1504 transitions. [2024-11-10 17:35:43,408 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1504 transitions. Word has length 99 [2024-11-10 17:35:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:43,409 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1504 transitions. [2024-11-10 17:35:43,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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:35:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1504 transitions. [2024-11-10 17:35:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 17:35:43,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:43,411 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] [2024-11-10 17:35:43,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-10 17:35:43,611 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:35:43,611 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-10 17:35:43,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2130799342, now seen corresponding path program 5 times [2024-11-10 17:35:43,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:43,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159433021] [2024-11-10 17:35:43,612 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:35:43,613 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:35:43,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:43,613 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:35:43,614 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:35:44,514 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:35:44,514 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:35:44,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 17:35:44,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:44,543 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:35:44,631 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 17:35:44,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-10 17:35:44,656 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:35:44,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-10 17:35:45,369 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:35:45,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-10 17:35:45,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-10 17:35:45,421 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:35:45,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:35:45,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159433021] [2024-11-10 17:35:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159433021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:35:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345584574] [2024-11-10 17:35:45,679 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:35:45,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:35:45,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:35:45,681 INFO L229 MonitoredProcess]: Starting monitored process 25 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:35:45,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process