./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-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 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:59:16,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:59:17,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:59:17,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:59:17,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:59:17,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:59:17,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:59:17,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:59:17,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:59:17,089 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:59:17,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:59:17,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:59:17,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:59:17,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:59:17,093 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:59:17,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:59:17,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:59:17,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:59:17,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:59:17,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:59:17,095 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:59:17,099 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:59:17,100 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:59:17,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:59:17,100 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:59:17,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:59:17,101 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:59:17,101 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:59:17,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:59:17,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:59:17,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:59:17,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:59:17,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:59:17,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:59:17,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:59:17,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:59:17,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:59:17,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:59:17,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:59:17,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:59:17,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:59:17,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:59:17,105 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 -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2024-10-13 11:59:17,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:59:17,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:59:17,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:59:17,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:59:17,420 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:59:17,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-2.i [2024-10-13 11:59:18,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:59:19,160 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:59:19,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-2.i [2024-10-13 11:59:19,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19422d78f/ca9c92b06f7a4280afbf436a77e90da8/FLAGd8bddfb15 [2024-10-13 11:59:19,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19422d78f/ca9c92b06f7a4280afbf436a77e90da8 [2024-10-13 11:59:19,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:59:19,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:59:19,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:59:19,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:59:19,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:59:19,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:59:19" (1/1) ... [2024-10-13 11:59:19,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eeb1304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:19, skipping insertion in model container [2024-10-13 11:59:19,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:59:19" (1/1) ... [2024-10-13 11:59:19,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:59:20,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:59:20,135 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 11:59:20,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1fd1340d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:20, skipping insertion in model container [2024-10-13 11:59:20,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:59:20,137 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:59:20,139 INFO L158 Benchmark]: Toolchain (without parser) took 709.71ms. Allocated memory is still 153.1MB. Free memory was 96.2MB in the beginning and 73.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 11:59:20,140 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 153.1MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:59:20,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.19ms. Allocated memory is still 153.1MB. Free memory was 96.2MB in the beginning and 73.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 11:59:20,143 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.27ms. Allocated memory is still 153.1MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.19ms. Allocated memory is still 153.1MB. Free memory was 96.2MB in the beginning and 73.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-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 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:59:22,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:59:22,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:59:22,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:59:22,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:59:22,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:59:22,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:59:22,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:59:22,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:59:22,439 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:59:22,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:59:22,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:59:22,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:59:22,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:59:22,441 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:59:22,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:59:22,444 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:59:22,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:59:22,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:59:22,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:59:22,445 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:59:22,449 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:59:22,449 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:59:22,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:59:22,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:59:22,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:59:22,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:59:22,451 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:59:22,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:59:22,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:59:22,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:59:22,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:59:22,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:59:22,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:59:22,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:59:22,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:59:22,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:59:22,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:59:22,453 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:59:22,453 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:59:22,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:59:22,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:59:22,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:59:22,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:59:22,454 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:59:22,455 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 -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2024-10-13 11:59:22,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:59:22,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:59:22,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:59:22,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:59:22,849 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:59:22,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-2.i [2024-10-13 11:59:24,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:59:24,746 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:59:24,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-2.i [2024-10-13 11:59:24,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe6bd06b/e9a2ff0e364d4cc4a77a5d891b83ad4f/FLAG990591e4f [2024-10-13 11:59:24,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe6bd06b/e9a2ff0e364d4cc4a77a5d891b83ad4f [2024-10-13 11:59:24,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:59:24,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:59:24,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:59:24,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:59:24,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:59:24,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:59:24" (1/1) ... [2024-10-13 11:59:24,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7a4b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:24, skipping insertion in model container [2024-10-13 11:59:24,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:59:24" (1/1) ... [2024-10-13 11:59:24,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:59:25,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:59:25,477 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:59:25,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:59:25,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:59:25,609 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:59:25,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:59:25,769 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:59:25,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25 WrapperNode [2024-10-13 11:59:25,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:59:25,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:59:25,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:59:25,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:59:25,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:25,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:25,890 INFO L138 Inliner]: procedures = 179, calls = 377, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1311 [2024-10-13 11:59:25,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:59:25,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:59:25,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:59:25,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:59:25,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:25,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:25,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:26,038 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-10-13 11:59:26,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:26,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:26,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:26,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:26,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:26,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:26,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:59:26,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:59:26,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:59:26,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:59:26,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (1/1) ... [2024-10-13 11:59:26,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:59:26,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:59:26,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:59:26,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-10-13 11:59:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:59:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:59:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:59:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:59:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:59:26,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:59:26,227 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:59:26,227 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:59:26,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:59:26,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:59:26,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:59:26,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:59:26,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:59:26,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:59:26,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:59:26,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:59:26,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:59:26,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:59:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:59:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:59:26,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:59:26,482 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:59:26,484 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:59:26,487 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:59:26,572 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:59:32,080 INFO L? ?]: Removed 1538 outVars from TransFormulas that were not future-live. [2024-10-13 11:59:32,081 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:59:32,287 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:59:32,290 INFO L314 CfgBuilder]: Removed 69 assume(true) statements. [2024-10-13 11:59:32,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:59:32 BoogieIcfgContainer [2024-10-13 11:59:32,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:59:32,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:59:32,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:59:32,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:59:32,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:59:24" (1/3) ... [2024-10-13 11:59:32,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9f5f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:59:32, skipping insertion in model container [2024-10-13 11:59:32,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:25" (2/3) ... [2024-10-13 11:59:32,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9f5f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:59:32, skipping insertion in model container [2024-10-13 11:59:32,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:59:32" (3/3) ... [2024-10-13 11:59:32,301 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-2.i [2024-10-13 11:59:32,318 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:59:32,319 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 733 error locations. [2024-10-13 11:59:32,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:59:32,403 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;@77ae569c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:59:32,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 733 error locations. [2024-10-13 11:59:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 1292 states, 557 states have (on average 2.556552962298025) internal successors, (1424), 1284 states have internal predecessors, (1424), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:59:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:59:32,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:32,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:59:32,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr732ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:32,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2086279, now seen corresponding path program 1 times [2024-10-13 11:59:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:32,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079914241] [2024-10-13 11:59:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:32,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:32,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 11:59:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:32,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:59:32,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:32,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:32,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:32,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079914241] [2024-10-13 11:59:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079914241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:59:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683155797] [2024-10-13 11:59:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:32,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:59:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:59:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:32,747 INFO L87 Difference]: Start difference. First operand has 1292 states, 557 states have (on average 2.556552962298025) internal successors, (1424), 1284 states have internal predecessors, (1424), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-13 11:59:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:35,144 INFO L93 Difference]: Finished difference Result 1463 states and 1542 transitions. [2024-10-13 11:59:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:59:35,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-13 11:59:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:35,163 INFO L225 Difference]: With dead ends: 1463 [2024-10-13 11:59:35,163 INFO L226 Difference]: Without dead ends: 1460 [2024-10-13 11:59:35,165 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-10-13 11:59:35,168 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 200 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:35,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1743 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 11:59:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-10-13 11:59:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1287. [2024-10-13 11:59:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 563 states have (on average 2.403197158081705) internal successors, (1353), 1279 states have internal predecessors, (1353), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:59:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1365 transitions. [2024-10-13 11:59:35,266 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1365 transitions. Word has length 3 [2024-10-13 11:59:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:35,266 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1365 transitions. [2024-10-13 11:59:35,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-13 11:59:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1365 transitions. [2024-10-13 11:59:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:59:35,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:35,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:59:35,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 11:59:35,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:35,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:35,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2002971235, now seen corresponding path program 1 times [2024-10-13 11:59:35,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:35,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315498316] [2024-10-13 11:59:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:35,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:35,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:35,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 11:59:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:35,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:59:35,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:35,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:59:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:35,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:35,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315498316] [2024-10-13 11:59:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315498316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:35,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:59:35,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737596076] [2024-10-13 11:59:35,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:35,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:59:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:59:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:35,683 INFO L87 Difference]: Start difference. First operand 1287 states and 1365 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:37,554 INFO L93 Difference]: Finished difference Result 1193 states and 1269 transitions. [2024-10-13 11:59:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:59:37,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 11:59:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:37,559 INFO L225 Difference]: With dead ends: 1193 [2024-10-13 11:59:37,560 INFO L226 Difference]: Without dead ends: 1193 [2024-10-13 11:59:37,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:37,561 INFO L432 NwaCegarLoop]: 614 mSDtfsCounter, 913 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:37,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 704 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:59:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-10-13 11:59:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2024-10-13 11:59:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 563 states have (on average 2.2326820603907636) internal successors, (1257), 1185 states have internal predecessors, (1257), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:59:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1269 transitions. [2024-10-13 11:59:37,583 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1269 transitions. Word has length 5 [2024-10-13 11:59:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:37,583 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1269 transitions. [2024-10-13 11:59:37,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1269 transitions. [2024-10-13 11:59:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:59:37,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:37,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:59:37,588 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-10-13 11:59:37,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:37,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:37,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:37,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2002971236, now seen corresponding path program 1 times [2024-10-13 11:59:37,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:37,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024273555] [2024-10-13 11:59:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:37,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:37,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:37,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 11:59:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:37,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:59:37,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:37,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:59:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:37,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:37,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:37,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024273555] [2024-10-13 11:59:37,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024273555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:37,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:37,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:59:37,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134516861] [2024-10-13 11:59:37,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:37,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:59:37,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:37,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:59:37,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:37,938 INFO L87 Difference]: Start difference. First operand 1193 states and 1269 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:41,188 INFO L93 Difference]: Finished difference Result 1473 states and 1569 transitions. [2024-10-13 11:59:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:59:41,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 11:59:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:41,193 INFO L225 Difference]: With dead ends: 1473 [2024-10-13 11:59:41,193 INFO L226 Difference]: Without dead ends: 1473 [2024-10-13 11:59:41,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:41,195 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 464 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:41,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1354 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 11:59:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2024-10-13 11:59:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1322. [2024-10-13 11:59:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 702 states have (on average 2.1923076923076925) internal successors, (1539), 1314 states have internal predecessors, (1539), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:59:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1551 transitions. [2024-10-13 11:59:41,224 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1551 transitions. Word has length 5 [2024-10-13 11:59:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:41,224 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1551 transitions. [2024-10-13 11:59:41,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1551 transitions. [2024-10-13 11:59:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:59:41,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:41,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:59:41,229 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-10-13 11:59:41,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:41,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:41,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1964225645, now seen corresponding path program 1 times [2024-10-13 11:59:41,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:41,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714965311] [2024-10-13 11:59:41,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:41,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:41,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:41,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:41,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 11:59:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:41,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:59:41,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:41,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:41,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714965311] [2024-10-13 11:59:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714965311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:59:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055143916] [2024-10-13 11:59:41,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:41,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:59:41,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:41,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:59:41,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:59:41,592 INFO L87 Difference]: Start difference. First operand 1322 states and 1551 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:43,565 INFO L93 Difference]: Finished difference Result 1999 states and 2354 transitions. [2024-10-13 11:59:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:59:43,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 11:59:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:43,572 INFO L225 Difference]: With dead ends: 1999 [2024-10-13 11:59:43,572 INFO L226 Difference]: Without dead ends: 1999 [2024-10-13 11:59:43,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:59:43,573 INFO L432 NwaCegarLoop]: 1092 mSDtfsCounter, 620 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:43,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 3057 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:59:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-10-13 11:59:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1700. [2024-10-13 11:59:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1080 states have (on average 2.162962962962963) internal successors, (2336), 1689 states have internal predecessors, (2336), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:59:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2354 transitions. [2024-10-13 11:59:43,619 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2354 transitions. Word has length 6 [2024-10-13 11:59:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:43,619 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2354 transitions. [2024-10-13 11:59:43,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2354 transitions. [2024-10-13 11:59:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:59:43,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:43,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:59:43,625 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-10-13 11:59:43,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:43,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:43,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2130237079, now seen corresponding path program 1 times [2024-10-13 11:59:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:43,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174536440] [2024-10-13 11:59:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:43,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:43,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:43,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:43,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 11:59:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:43,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:59:43,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:44,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:44,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:44,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174536440] [2024-10-13 11:59:44,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174536440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:44,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:44,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:59:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549682012] [2024-10-13 11:59:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:44,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:59:44,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:44,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:59:44,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:44,009 INFO L87 Difference]: Start difference. First operand 1700 states and 2354 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-10-13 11:59:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:45,189 INFO L93 Difference]: Finished difference Result 1789 states and 2307 transitions. [2024-10-13 11:59:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:59:45,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-10-13 11:59:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:45,198 INFO L225 Difference]: With dead ends: 1789 [2024-10-13 11:59:45,199 INFO L226 Difference]: Without dead ends: 1789 [2024-10-13 11:59:45,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:45,200 INFO L432 NwaCegarLoop]: 1144 mSDtfsCounter, 285 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:45,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2175 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:59:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2024-10-13 11:59:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1589. [2024-10-13 11:59:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 969 states have (on average 2.1733746130030958) internal successors, (2106), 1578 states have internal predecessors, (2106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:59:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2124 transitions. [2024-10-13 11:59:45,266 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2124 transitions. Word has length 8 [2024-10-13 11:59:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:45,266 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2124 transitions. [2024-10-13 11:59:45,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-10-13 11:59:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2124 transitions. [2024-10-13 11:59:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 11:59:45,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:45,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:59:45,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 (6)] Ended with exit code 0 [2024-10-13 11:59:45,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:45,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:45,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash -463868595, now seen corresponding path program 1 times [2024-10-13 11:59:45,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:45,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27386020] [2024-10-13 11:59:45,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:45,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:45,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:45,473 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:45,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 11:59:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:45,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:59:45,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:45,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:45,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27386020] [2024-10-13 11:59:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27386020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:45,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:59:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637368263] [2024-10-13 11:59:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:45,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:59:45,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:45,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:59:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:45,626 INFO L87 Difference]: Start difference. First operand 1589 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:46,351 INFO L93 Difference]: Finished difference Result 1535 states and 2044 transitions. [2024-10-13 11:59:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:59:46,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-10-13 11:59:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:46,357 INFO L225 Difference]: With dead ends: 1535 [2024-10-13 11:59:46,357 INFO L226 Difference]: Without dead ends: 1535 [2024-10-13 11:59:46,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:46,358 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 61 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:46,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2050 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:59:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-10-13 11:59:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2024-10-13 11:59:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 939 states have (on average 2.1576144834930777) internal successors, (2026), 1524 states have internal predecessors, (2026), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:59:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2044 transitions. [2024-10-13 11:59:46,389 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2044 transitions. Word has length 11 [2024-10-13 11:59:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:46,390 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2044 transitions. [2024-10-13 11:59:46,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2044 transitions. [2024-10-13 11:59:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 11:59:46,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:46,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:59:46,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 11:59:46,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:46,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr629REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -536402057, now seen corresponding path program 1 times [2024-10-13 11:59:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936820874] [2024-10-13 11:59:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:46,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:46,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:46,596 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:46,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 11:59:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:46,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:59:46,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:46,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:46,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936820874] [2024-10-13 11:59:46,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936820874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:46,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:59:46,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833774294] [2024-10-13 11:59:46,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:46,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:59:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:59:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:59:46,788 INFO L87 Difference]: Start difference. First operand 1535 states and 2044 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:48,700 INFO L93 Difference]: Finished difference Result 1711 states and 2226 transitions. [2024-10-13 11:59:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:59:48,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-10-13 11:59:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:48,705 INFO L225 Difference]: With dead ends: 1711 [2024-10-13 11:59:48,705 INFO L226 Difference]: Without dead ends: 1705 [2024-10-13 11:59:48,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:59:48,707 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 247 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:48,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 3016 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:59:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-10-13 11:59:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1529. [2024-10-13 11:59:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 933 states have (on average 2.1639871382636655) internal successors, (2019), 1518 states have internal predecessors, (2019), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:59:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2037 transitions. [2024-10-13 11:59:48,738 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2037 transitions. Word has length 11 [2024-10-13 11:59:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:48,740 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2037 transitions. [2024-10-13 11:59:48,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2037 transitions. [2024-10-13 11:59:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 11:59:48,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:48,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:59:48,747 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-10-13 11:59:48,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:48,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:48,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash 898875271, now seen corresponding path program 1 times [2024-10-13 11:59:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781950430] [2024-10-13 11:59:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:48,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:48,948 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:48,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 11:59:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:49,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:59:49,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:49,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-10-13 11:59:49,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:49,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781950430] [2024-10-13 11:59:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781950430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:49,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:49,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:59:49,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066545608] [2024-10-13 11:59:49,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:49,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:59:49,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:59:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:59:49,102 INFO L87 Difference]: Start difference. First operand 1529 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:50,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:50,018 INFO L93 Difference]: Finished difference Result 1513 states and 1993 transitions. [2024-10-13 11:59:50,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:59:50,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-10-13 11:59:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:50,024 INFO L225 Difference]: With dead ends: 1513 [2024-10-13 11:59:50,024 INFO L226 Difference]: Without dead ends: 1513 [2024-10-13 11:59:50,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:59:50,024 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 45 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:50,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3027 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:59:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-10-13 11:59:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2024-10-13 11:59:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 931 states have (on average 2.121374865735768) internal successors, (1975), 1502 states have internal predecessors, (1975), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:59:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1993 transitions. [2024-10-13 11:59:50,052 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1993 transitions. Word has length 13 [2024-10-13 11:59:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:50,053 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1993 transitions. [2024-10-13 11:59:50,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1993 transitions. [2024-10-13 11:59:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 11:59:50,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:50,066 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] [2024-10-13 11:59:50,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 11:59:50,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:50,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:50,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash 332414229, now seen corresponding path program 1 times [2024-10-13 11:59:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:50,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397477241] [2024-10-13 11:59:50,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:50,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:50,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:50,270 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:50,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:59:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:50,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:59:50,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:50,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:59:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:50,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:50,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:50,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397477241] [2024-10-13 11:59:50,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397477241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:50,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:50,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:59:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552697688] [2024-10-13 11:59:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:50,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:59:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:59:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:59:50,516 INFO L87 Difference]: Start difference. First operand 1513 states and 1993 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:52,659 INFO L93 Difference]: Finished difference Result 1517 states and 1993 transitions. [2024-10-13 11:59:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:59:52,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-10-13 11:59:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:52,663 INFO L225 Difference]: With dead ends: 1517 [2024-10-13 11:59:52,663 INFO L226 Difference]: Without dead ends: 1517 [2024-10-13 11:59:52,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:59:52,664 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 857 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:52,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1114 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 11:59:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-10-13 11:59:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1509. [2024-10-13 11:59:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 931 states have (on average 2.112781954887218) internal successors, (1967), 1498 states have internal predecessors, (1967), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:59:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1985 transitions. [2024-10-13 11:59:52,687 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1985 transitions. Word has length 27 [2024-10-13 11:59:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:52,688 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1985 transitions. [2024-10-13 11:59:52,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1985 transitions. [2024-10-13 11:59:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 11:59:52,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:52,689 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] [2024-10-13 11:59:52,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 11:59:52,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:52,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 332414230, now seen corresponding path program 1 times [2024-10-13 11:59:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840969207] [2024-10-13 11:59:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:52,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:52,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:52,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:52,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:59:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:53,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:59:53,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:53,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:59:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:53,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:53,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840969207] [2024-10-13 11:59:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840969207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:59:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671632071] [2024-10-13 11:59:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:53,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:59:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:59:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:59:53,219 INFO L87 Difference]: Start difference. First operand 1509 states and 1985 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:56,443 INFO L93 Difference]: Finished difference Result 1664 states and 2003 transitions. [2024-10-13 11:59:56,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:59:56,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-10-13 11:59:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:56,448 INFO L225 Difference]: With dead ends: 1664 [2024-10-13 11:59:56,448 INFO L226 Difference]: Without dead ends: 1664 [2024-10-13 11:59:56,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:59:56,449 INFO L432 NwaCegarLoop]: 1122 mSDtfsCounter, 404 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:56,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2169 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 11:59:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-10-13 11:59:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1505. [2024-10-13 11:59:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 931 states have (on average 2.104189044038668) internal successors, (1959), 1494 states have internal predecessors, (1959), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:59:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1977 transitions. [2024-10-13 11:59:56,470 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1977 transitions. Word has length 27 [2024-10-13 11:59:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:56,470 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1977 transitions. [2024-10-13 11:59:56,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1977 transitions. [2024-10-13 11:59:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 11:59:56,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:56,471 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] [2024-10-13 11:59:56,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 11:59:56,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:56,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -24905803, now seen corresponding path program 1 times [2024-10-13 11:59:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952579738] [2024-10-13 11:59:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:56,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:56,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:56,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:56,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 11:59:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:56,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:59:56,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:56,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:56,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:56,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952579738] [2024-10-13 11:59:56,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952579738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:56,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:56,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:59:56,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262679298] [2024-10-13 11:59:56,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:56,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:59:56,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:59:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:59:56,938 INFO L87 Difference]: Start difference. First operand 1505 states and 1977 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:57,847 INFO L93 Difference]: Finished difference Result 1493 states and 1957 transitions. [2024-10-13 11:59:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:59:57,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2024-10-13 11:59:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:57,853 INFO L225 Difference]: With dead ends: 1493 [2024-10-13 11:59:57,853 INFO L226 Difference]: Without dead ends: 1493 [2024-10-13 11:59:57,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:59:57,854 INFO L432 NwaCegarLoop]: 1009 mSDtfsCounter, 15 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:57,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3010 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:59:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2024-10-13 11:59:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2024-10-13 11:59:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 919 states have (on average 2.1099020674646356) internal successors, (1939), 1482 states have internal predecessors, (1939), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:59:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1957 transitions. [2024-10-13 11:59:57,876 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1957 transitions. Word has length 46 [2024-10-13 11:59:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:57,877 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1957 transitions. [2024-10-13 11:59:57,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:59:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1957 transitions. [2024-10-13 11:59:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 11:59:57,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:57,878 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] [2024-10-13 11:59:57,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:59:58,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:58,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 11:59:58,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 28068373, now seen corresponding path program 1 times [2024-10-13 11:59:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273765943] [2024-10-13 11:59:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:58,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:59:58,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:58,084 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:59:58,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:59:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:58,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:59:58,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:58,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:59:58,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:59:58,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:59:58,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:59:58,860 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:59:58,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:59:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:59:58,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:58,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273765943] [2024-10-13 11:59:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273765943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:59:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981068942] [2024-10-13 11:59:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:58,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:59:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:59:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:59:58,876 INFO L87 Difference]: Start difference. First operand 1493 states and 1957 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:00:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:00,589 INFO L93 Difference]: Finished difference Result 1409 states and 1832 transitions. [2024-10-13 12:00:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:00,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-10-13 12:00:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:00,594 INFO L225 Difference]: With dead ends: 1409 [2024-10-13 12:00:00,595 INFO L226 Difference]: Without dead ends: 1409 [2024-10-13 12:00:00,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:00,596 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 1564 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:00,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 485 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 12:00:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-13 12:00:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1270. [2024-10-13 12:00:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 780 states have (on average 1.9512820512820512) internal successors, (1522), 1259 states have internal predecessors, (1522), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 12:00:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1540 transitions. [2024-10-13 12:00:00,614 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1540 transitions. Word has length 50 [2024-10-13 12:00:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1540 transitions. [2024-10-13 12:00:00,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:00:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1540 transitions. [2024-10-13 12:00:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 12:00:00,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:00,616 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] [2024-10-13 12:00:00,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 12:00:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:00,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:00:00,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash -957272213, now seen corresponding path program 1 times [2024-10-13 12:00:00,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:00,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66596033] [2024-10-13 12:00:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:00,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:00,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:00,821 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:00:00,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 12:00:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:01,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:00:01,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:01,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:00:01,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:00:01,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 12:00:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:01,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:01,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66596033] [2024-10-13 12:00:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66596033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:01,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:01,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:00:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896858184] [2024-10-13 12:00:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:00:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:00:01,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:00:01,149 INFO L87 Difference]: Start difference. First operand 1270 states and 1540 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:00:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:03,831 INFO L93 Difference]: Finished difference Result 1269 states and 1538 transitions. [2024-10-13 12:00:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:00:03,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2024-10-13 12:00:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:03,836 INFO L225 Difference]: With dead ends: 1269 [2024-10-13 12:00:03,836 INFO L226 Difference]: Without dead ends: 1269 [2024-10-13 12:00:03,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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-10-13 12:00:03,837 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 2 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:03,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2370 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 12:00:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-10-13 12:00:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1269. [2024-10-13 12:00:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 780 states have (on average 1.9487179487179487) internal successors, (1520), 1258 states have internal predecessors, (1520), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 12:00:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1538 transitions. [2024-10-13 12:00:03,859 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1538 transitions. Word has length 54 [2024-10-13 12:00:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:03,860 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1538 transitions. [2024-10-13 12:00:03,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:00:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1538 transitions. [2024-10-13 12:00:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 12:00:03,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:03,863 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] [2024-10-13 12:00:03,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-13 12:00:04,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:04,068 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:00:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash -957272212, now seen corresponding path program 1 times [2024-10-13 12:00:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:04,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378362701] [2024-10-13 12:00:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:04,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:04,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:04,070 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:00:04,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 12:00:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:04,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:00:04,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:04,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:00:04,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 12:00:04,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:00:04,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 12:00:04,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-10-13 12:00:04,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:04,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:04,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378362701] [2024-10-13 12:00:04,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378362701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:04,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:04,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:00:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776358518] [2024-10-13 12:00:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:04,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:00:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:00:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:00:04,438 INFO L87 Difference]: Start difference. First operand 1269 states and 1538 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:00:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:08,114 INFO L93 Difference]: Finished difference Result 1268 states and 1536 transitions. [2024-10-13 12:00:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:00:08,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2024-10-13 12:00:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:08,118 INFO L225 Difference]: With dead ends: 1268 [2024-10-13 12:00:08,118 INFO L226 Difference]: Without dead ends: 1268 [2024-10-13 12:00:08,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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-10-13 12:00:08,119 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 1 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:08,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2399 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 12:00:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-10-13 12:00:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1268. [2024-10-13 12:00:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 778 states have (on average 1.9511568123393317) internal successors, (1518), 1257 states have internal predecessors, (1518), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 12:00:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1536 transitions. [2024-10-13 12:00:08,134 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1536 transitions. Word has length 54 [2024-10-13 12:00:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:08,134 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1536 transitions. [2024-10-13 12:00:08,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:00:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1536 transitions. [2024-10-13 12:00:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 12:00:08,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:08,136 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] [2024-10-13 12:00:08,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 12:00:08,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:08,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:00:08,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash 634687919, now seen corresponding path program 1 times [2024-10-13 12:00:08,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:08,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491327760] [2024-10-13 12:00:08,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:08,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:08,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:08,343 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:00:08,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 12:00:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:08,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:00:08,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:08,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:08,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:08,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491327760] [2024-10-13 12:00:08,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491327760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:08,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:08,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:00:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315692275] [2024-10-13 12:00:08,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:08,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:08,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:08,676 INFO L87 Difference]: Start difference. First operand 1268 states and 1536 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:00:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:10,081 INFO L93 Difference]: Finished difference Result 1270 states and 1541 transitions. [2024-10-13 12:00:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 60 [2024-10-13 12:00:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:10,090 INFO L225 Difference]: With dead ends: 1270 [2024-10-13 12:00:10,090 INFO L226 Difference]: Without dead ends: 1270 [2024-10-13 12:00:10,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:10,091 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 0 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:10,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2802 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 12:00:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-10-13 12:00:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2024-10-13 12:00:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 779 states have (on average 1.951219512195122) internal successors, (1520), 1259 states have internal predecessors, (1520), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 12:00:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1541 transitions. [2024-10-13 12:00:10,112 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1541 transitions. Word has length 60 [2024-10-13 12:00:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:10,112 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1541 transitions. [2024-10-13 12:00:10,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:00:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1541 transitions. [2024-10-13 12:00:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 12:00:10,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:10,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:10,124 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 (16)] Ended with exit code 0 [2024-10-13 12:00:10,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:10,314 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:00:10,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1766215004, now seen corresponding path program 1 times [2024-10-13 12:00:10,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772076880] [2024-10-13 12:00:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:10,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:10,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:10,317 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:00:10,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 12:00:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:10,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:00:10,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:10,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:00:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:10,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772076880] [2024-10-13 12:00:10,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772076880] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:00:10,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:00:10,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 12:00:10,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563698361] [2024-10-13 12:00:10,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:00:10,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:00:10,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:00:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:00:10,760 INFO L87 Difference]: Start difference. First operand 1270 states and 1541 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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-10-13 12:00:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:12,164 INFO L93 Difference]: Finished difference Result 1279 states and 1557 transitions. [2024-10-13 12:00:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:00:12,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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 61 [2024-10-13 12:00:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:12,176 INFO L225 Difference]: With dead ends: 1279 [2024-10-13 12:00:12,177 INFO L226 Difference]: Without dead ends: 1279 [2024-10-13 12:00:12,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:00:12,179 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 5 mSDsluCounter, 2792 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:12,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3726 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 12:00:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-10-13 12:00:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1278. [2024-10-13 12:00:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 786 states have (on average 1.950381679389313) internal successors, (1533), 1266 states have internal predecessors, (1533), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 12:00:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1554 transitions. [2024-10-13 12:00:12,223 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1554 transitions. Word has length 61 [2024-10-13 12:00:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:12,223 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1554 transitions. [2024-10-13 12:00:12,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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-10-13 12:00:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1554 transitions. [2024-10-13 12:00:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 12:00:12,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:12,230 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] [2024-10-13 12:00:12,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-13 12:00:12,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:12,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:00:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1379701999, now seen corresponding path program 2 times [2024-10-13 12:00:12,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:12,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486195704] [2024-10-13 12:00:12,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:00:12,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:12,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:12,434 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:00:12,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 12:00:12,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:00:12,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:00:12,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:00:12,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:12,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:00:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:13,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:13,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486195704] [2024-10-13 12:00:13,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486195704] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:00:13,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:00:13,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 12:00:13,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271755866] [2024-10-13 12:00:13,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:00:13,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:00:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:13,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:00:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:00:13,057 INFO L87 Difference]: Start difference. First operand 1278 states and 1554 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 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-10-13 12:00:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:15,279 INFO L93 Difference]: Finished difference Result 1290 states and 1575 transitions. [2024-10-13 12:00:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 12:00:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 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 64 [2024-10-13 12:00:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:15,286 INFO L225 Difference]: With dead ends: 1290 [2024-10-13 12:00:15,286 INFO L226 Difference]: Without dead ends: 1288 [2024-10-13 12:00:15,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 12:00:15,287 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 7 mSDsluCounter, 4660 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5594 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:15,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5594 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 12:00:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-13 12:00:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1287. [2024-10-13 12:00:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 795 states have (on average 1.9433962264150944) internal successors, (1545), 1275 states have internal predecessors, (1545), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 12:00:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1566 transitions. [2024-10-13 12:00:15,327 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1566 transitions. Word has length 64 [2024-10-13 12:00:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:15,328 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1566 transitions. [2024-10-13 12:00:15,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 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-10-13 12:00:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1566 transitions. [2024-10-13 12:00:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 12:00:15,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:15,330 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] [2024-10-13 12:00:15,342 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 (18)] Ended with exit code 0 [2024-10-13 12:00:15,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:15,531 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:00:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1898499535, now seen corresponding path program 3 times [2024-10-13 12:00:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447942882] [2024-10-13 12:00:15,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:00:15,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:15,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:15,534 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:00:15,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 12:00:16,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 12:00:16,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:00:16,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:00:16,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:16,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:00:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:16,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447942882] [2024-10-13 12:00:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447942882] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:00:16,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:00:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 12:00:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176779072] [2024-10-13 12:00:16,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:00:16,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 12:00:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 12:00:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:00:16,910 INFO L87 Difference]: Start difference. First operand 1287 states and 1566 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 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-10-13 12:00:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:21,741 INFO L93 Difference]: Finished difference Result 1308 states and 1602 transitions. [2024-10-13 12:00:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 12:00:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 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 70 [2024-10-13 12:00:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:21,747 INFO L225 Difference]: With dead ends: 1308 [2024-10-13 12:00:21,747 INFO L226 Difference]: Without dead ends: 1305 [2024-10-13 12:00:21,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 12:00:21,749 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 13 mSDsluCounter, 10248 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11182 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:21,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11182 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 12:00:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2024-10-13 12:00:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1305. [2024-10-13 12:00:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 813 states have (on average 1.928659286592866) internal successors, (1568), 1293 states have internal predecessors, (1568), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 12:00:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1589 transitions. [2024-10-13 12:00:21,773 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1589 transitions. Word has length 70 [2024-10-13 12:00:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:21,774 INFO L471 AbstractCegarLoop]: Abstraction has 1305 states and 1589 transitions. [2024-10-13 12:00:21,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 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-10-13 12:00:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1589 transitions. [2024-10-13 12:00:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 12:00:21,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:21,776 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] [2024-10-13 12:00:21,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 12:00:21,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:21,977 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:00:21,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash -830683249, now seen corresponding path program 4 times [2024-10-13 12:00:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:21,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902609638] [2024-10-13 12:00:21,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:00:21,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:21,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:21,980 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:00:21,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 12:00:22,479 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:00:22,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:00:22,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 12:00:22,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:22,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:00:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:24,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902609638] [2024-10-13 12:00:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902609638] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:00:24,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:00:24,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 12:00:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374025419] [2024-10-13 12:00:24,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:00:24,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 12:00:24,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:24,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 12:00:24,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 12:00:24,032 INFO L87 Difference]: Start difference. First operand 1305 states and 1589 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 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-10-13 12:00:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:35,602 INFO L93 Difference]: Finished difference Result 1342 states and 1660 transitions. [2024-10-13 12:00:35,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 12:00:35,605 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-10-13 12:00:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:35,608 INFO L225 Difference]: With dead ends: 1342 [2024-10-13 12:00:35,608 INFO L226 Difference]: Without dead ends: 1340 [2024-10-13 12:00:35,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 12:00:35,611 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 25 mSDsluCounter, 26086 mSDsCounter, 0 mSdLazyCounter, 5646 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 27020 SdHoareTripleChecker+Invalid, 5683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 5646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:35,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 27020 Invalid, 5683 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 5646 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-10-13 12:00:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2024-10-13 12:00:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1339. [2024-10-13 12:00:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 847 states have (on average 1.9055489964580874) internal successors, (1614), 1327 states have internal predecessors, (1614), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 12:00:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1635 transitions. [2024-10-13 12:00:35,642 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1635 transitions. Word has length 82 [2024-10-13 12:00:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:35,642 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1635 transitions. [2024-10-13 12:00:35,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 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-10-13 12:00:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1635 transitions. [2024-10-13 12:00:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 12:00:35,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:35,644 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] [2024-10-13 12:00:35,658 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-10-13 12:00:35,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:35,845 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:00:35,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash 960845167, now seen corresponding path program 5 times [2024-10-13 12:00:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:35,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539166006] [2024-10-13 12:00:35,846 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:00:35,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:35,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:35,847 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:00:35,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 12:00:36,977 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 12:00:36,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:00:36,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 12:00:37,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:37,022 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 12:00:37,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-13 12:00:37,374 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-13 12:00:37,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-13 12:00:37,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:00:37,594 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 42 treesize of output 24 [2024-10-13 12:00:40,010 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 12:00:40,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-13 12:00:40,090 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 51 treesize of output 27 [2024-10-13 12:00:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 12:00:40,141 INFO L311 TraceCheckSpWp]: Computing backward predicates...