./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22b4144b7005899e18ff8135fa52f12863f7106dbe1ddb808d25d8593c5f8fc4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:08:29,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:08:29,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:08:29,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:08:29,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:08:29,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:08:29,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:08:29,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:08:29,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:08:29,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:08:29,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:08:29,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:08:29,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:08:29,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:08:29,371 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:08:29,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:08:29,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:08:29,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:08:29,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:08:29,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:08:29,373 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:08:29,374 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:08:29,374 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:08:29,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:08:29,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:08:29,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:08:29,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:08:29,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:08:29,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:08:29,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:08:29,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:08:29,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:08:29,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:08:29,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:08:29,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:08:29,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:08:29,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:08:29,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:08:29,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:08:29,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:08:29,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:08:29,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:08:29,381 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 -> 22b4144b7005899e18ff8135fa52f12863f7106dbe1ddb808d25d8593c5f8fc4 [2024-10-14 19:08:29,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:08:29,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:08:29,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:08:29,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:08:29,657 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:08:29,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i [2024-10-14 19:08:31,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:08:31,360 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:08:31,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i [2024-10-14 19:08:31,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e13b8028/bee4d4810a0e48e2aa435fd39f0ef454/FLAGce8da4ad7 [2024-10-14 19:08:31,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e13b8028/bee4d4810a0e48e2aa435fd39f0ef454 [2024-10-14 19:08:31,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:08:31,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:08:31,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:08:31,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:08:31,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:08:31,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:31" (1/1) ... [2024-10-14 19:08:31,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4366a433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:31, skipping insertion in model container [2024-10-14 19:08:31,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:31" (1/1) ... [2024-10-14 19:08:31,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:08:32,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:08:32,021 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 19:08:32,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@145e97f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:32, skipping insertion in model container [2024-10-14 19:08:32,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:08:32,023 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:08:32,025 INFO L158 Benchmark]: Toolchain (without parser) took 628.21ms. Allocated memory is still 144.7MB. Free memory was 87.0MB in the beginning and 104.3MB in the end (delta: -17.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 19:08:32,025 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:08:32,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.37ms. Allocated memory is still 144.7MB. Free memory was 86.6MB in the beginning and 104.9MB in the end (delta: -18.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 19:08:32,028 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.15ms. Allocated memory is still 96.5MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.37ms. Allocated memory is still 144.7MB. Free memory was 86.6MB in the beginning and 104.9MB in the end (delta: -18.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: 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_JEN_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22b4144b7005899e18ff8135fa52f12863f7106dbe1ddb808d25d8593c5f8fc4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:08:34,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:08:34,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:08:34,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:08:34,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:08:34,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:08:34,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:08:34,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:08:34,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:08:34,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:08:34,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:08:34,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:08:34,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:08:34,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:08:34,139 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:08:34,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:08:34,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:08:34,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:08:34,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:08:34,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:08:34,141 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:08:34,145 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:08:34,145 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:08:34,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:08:34,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:08:34,146 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:08:34,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:08:34,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:08:34,147 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:08:34,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:08:34,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:08:34,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:08:34,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:08:34,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:08:34,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:08:34,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:08:34,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:08:34,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:08:34,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:08:34,149 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:08:34,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:08:34,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:08:34,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:08:34,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:08:34,152 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:08:34,152 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 -> 22b4144b7005899e18ff8135fa52f12863f7106dbe1ddb808d25d8593c5f8fc4 [2024-10-14 19:08:34,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:08:34,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:08:34,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:08:34,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:08:34,487 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:08:34,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i [2024-10-14 19:08:35,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:08:36,206 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:08:36,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i [2024-10-14 19:08:36,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb9f3b5b/2881eeccca714669aebeeef2c7e88486/FLAG810924616 [2024-10-14 19:08:36,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb9f3b5b/2881eeccca714669aebeeef2c7e88486 [2024-10-14 19:08:36,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:08:36,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:08:36,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:08:36,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:08:36,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:08:36,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:36" (1/1) ... [2024-10-14 19:08:36,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339ed006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:36, skipping insertion in model container [2024-10-14 19:08:36,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:36" (1/1) ... [2024-10-14 19:08:36,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:08:37,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:08:37,148 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:08:37,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:08:37,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:08:37,262 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:08:37,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:08:37,400 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:08:37,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37 WrapperNode [2024-10-14 19:08:37,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:08:37,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:08:37,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:08:37,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:08:37,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,526 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2024-10-14 19:08:37,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:08:37,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:08:37,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:08:37,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:08:37,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,639 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-14 19:08:37,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:08:37,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:08:37,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:08:37,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:08:37,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (1/1) ... [2024-10-14 19:08:37,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:08:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:08:37,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:08:37,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:08:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 19:08:37,817 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 19:08:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:08:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:08:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:08:37,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:08:37,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:08:37,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:08:37,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:08:37,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:08:37,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:08:37,820 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:08:37,820 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:08:37,820 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:08:37,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:08:37,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:08:37,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:08:37,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:08:37,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:08:37,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:08:37,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:08:37,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:08:37,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:08:37,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:08:37,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:08:37,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:08:37,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:08:37,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:08:37,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:08:37,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:08:37,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:08:37,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:08:38,081 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:08:38,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:08:38,108 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:08:38,150 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:08:38,173 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:08:41,753 INFO L? ?]: Removed 1074 outVars from TransFormulas that were not future-live. [2024-10-14 19:08:41,753 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:08:41,926 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:08:41,926 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 19:08:41,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:41 BoogieIcfgContainer [2024-10-14 19:08:41,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:08:41,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:08:41,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:08:41,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:08:41,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:08:36" (1/3) ... [2024-10-14 19:08:41,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e987779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:41, skipping insertion in model container [2024-10-14 19:08:41,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:37" (2/3) ... [2024-10-14 19:08:41,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e987779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:41, skipping insertion in model container [2024-10-14 19:08:41,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:41" (3/3) ... [2024-10-14 19:08:41,935 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test7-1.i [2024-10-14 19:08:41,965 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:08:41,966 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 523 error locations. [2024-10-14 19:08:42,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:08:42,052 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;@73058eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:08:42,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 523 error locations. [2024-10-14 19:08:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 950 states, 422 states have (on average 2.523696682464455) internal successors, (1065), 943 states have internal predecessors, (1065), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 19:08:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:08:42,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:42,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:08:42,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:42,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash 54073, now seen corresponding path program 1 times [2024-10-14 19:08:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585589941] [2024-10-14 19:08:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:42,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:42,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:42,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:08:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:42,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:08:42,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:42,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:42,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:42,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:42,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585589941] [2024-10-14 19:08:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585589941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:42,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:42,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:08:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195270016] [2024-10-14 19:08:42,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:42,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:42,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:42,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:42,353 INFO L87 Difference]: Start difference. First operand has 950 states, 422 states have (on average 2.523696682464455) internal successors, (1065), 943 states have internal predecessors, (1065), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:43,926 INFO L93 Difference]: Finished difference Result 942 states and 998 transitions. [2024-10-14 19:08:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:43,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:08:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:43,944 INFO L225 Difference]: With dead ends: 942 [2024-10-14 19:08:43,944 INFO L226 Difference]: Without dead ends: 941 [2024-10-14 19:08:43,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:43,950 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 867 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:43,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 558 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:08:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-14 19:08:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 933. [2024-10-14 19:08:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 424 states have (on average 2.313679245283019) internal successors, (981), 927 states have internal predecessors, (981), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 989 transitions. [2024-10-14 19:08:44,040 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 989 transitions. Word has length 2 [2024-10-14 19:08:44,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:44,041 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 989 transitions. [2024-10-14 19:08:44,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 989 transitions. [2024-10-14 19:08:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:08:44,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:44,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:08:44,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:08:44,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:44,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:44,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash 54074, now seen corresponding path program 1 times [2024-10-14 19:08:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:44,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072496020] [2024-10-14 19:08:44,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:44,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:44,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:44,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:08:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:44,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:08:44,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:44,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:44,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:44,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072496020] [2024-10-14 19:08:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072496020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:44,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:44,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:08:44,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902712936] [2024-10-14 19:08:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:44,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:44,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:44,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:44,381 INFO L87 Difference]: Start difference. First operand 933 states and 989 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:46,132 INFO L93 Difference]: Finished difference Result 1294 states and 1382 transitions. [2024-10-14 19:08:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:46,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:08:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:46,137 INFO L225 Difference]: With dead ends: 1294 [2024-10-14 19:08:46,137 INFO L226 Difference]: Without dead ends: 1294 [2024-10-14 19:08:46,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:46,138 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 390 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:46,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1198 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:08:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-10-14 19:08:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1106. [2024-10-14 19:08:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 598 states have (on average 2.2876254180602005) internal successors, (1368), 1100 states have internal predecessors, (1368), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1376 transitions. [2024-10-14 19:08:46,164 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1376 transitions. Word has length 2 [2024-10-14 19:08:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:46,164 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1376 transitions. [2024-10-14 19:08:46,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1376 transitions. [2024-10-14 19:08:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 19:08:46,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:46,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:08:46,169 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-14 19:08:46,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:46,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:46,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1601587645, now seen corresponding path program 1 times [2024-10-14 19:08:46,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:46,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022375050] [2024-10-14 19:08:46,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:46,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:46,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:46,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:46,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:08:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:46,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:08:46,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:46,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:46,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:46,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:08:46,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:08:46,645 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:08:46,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:08:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:46,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:46,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:46,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022375050] [2024-10-14 19:08:46,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022375050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:46,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:46,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:08:46,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787791221] [2024-10-14 19:08:46,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:46,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:46,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:46,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:46,676 INFO L87 Difference]: Start difference. First operand 1106 states and 1376 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:48,827 INFO L93 Difference]: Finished difference Result 1108 states and 1380 transitions. [2024-10-14 19:08:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 19:08:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:48,832 INFO L225 Difference]: With dead ends: 1108 [2024-10-14 19:08:48,832 INFO L226 Difference]: Without dead ends: 1108 [2024-10-14 19:08:48,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:48,836 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1816 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:48,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 281 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 19:08:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-10-14 19:08:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 921. [2024-10-14 19:08:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 424 states have (on average 2.2830188679245285) internal successors, (968), 915 states have internal predecessors, (968), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 976 transitions. [2024-10-14 19:08:48,855 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 976 transitions. Word has length 6 [2024-10-14 19:08:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:48,857 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 976 transitions. [2024-10-14 19:08:48,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 976 transitions. [2024-10-14 19:08:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:08:48,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:48,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:48,864 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-14 19:08:49,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:49,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:49,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1890390559, now seen corresponding path program 1 times [2024-10-14 19:08:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010674837] [2024-10-14 19:08:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:49,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:49,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:49,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:49,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:08:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:49,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:08:49,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:49,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:49,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-14 19:08:49,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:49,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010674837] [2024-10-14 19:08:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010674837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:49,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:08:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475458185] [2024-10-14 19:08:49,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:49,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:49,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:49,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:49,219 INFO L87 Difference]: Start difference. First operand 921 states and 976 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:51,305 INFO L93 Difference]: Finished difference Result 1344 states and 1436 transitions. [2024-10-14 19:08:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:08:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:51,311 INFO L225 Difference]: With dead ends: 1344 [2024-10-14 19:08:51,311 INFO L226 Difference]: Without dead ends: 1344 [2024-10-14 19:08:51,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:51,316 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 623 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:51,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1302 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 19:08:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-10-14 19:08:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 938. [2024-10-14 19:08:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 451 states have (on average 2.2749445676274944) internal successors, (1026), 932 states have internal predecessors, (1026), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1034 transitions. [2024-10-14 19:08:51,339 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1034 transitions. Word has length 7 [2024-10-14 19:08:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:51,339 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1034 transitions. [2024-10-14 19:08:51,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1034 transitions. [2024-10-14 19:08:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:08:51,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:51,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:51,347 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-14 19:08:51,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:51,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:51,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1890390558, now seen corresponding path program 1 times [2024-10-14 19:08:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241878536] [2024-10-14 19:08:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:51,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:51,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:51,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:51,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:08:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:51,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:08:51,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:51,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:51,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:51,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:51,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241878536] [2024-10-14 19:08:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241878536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:51,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:08:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28470315] [2024-10-14 19:08:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:51,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:51,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:51,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:51,692 INFO L87 Difference]: Start difference. First operand 938 states and 1034 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:53,115 INFO L93 Difference]: Finished difference Result 1239 states and 1361 transitions. [2024-10-14 19:08:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:08:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:53,119 INFO L225 Difference]: With dead ends: 1239 [2024-10-14 19:08:53,119 INFO L226 Difference]: Without dead ends: 1239 [2024-10-14 19:08:53,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:53,120 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 830 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:53,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 973 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:08:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-10-14 19:08:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 891. [2024-10-14 19:08:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 451 states have (on average 2.161862527716186) internal successors, (975), 885 states have internal predecessors, (975), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 983 transitions. [2024-10-14 19:08:53,139 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 983 transitions. Word has length 7 [2024-10-14 19:08:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:53,140 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 983 transitions. [2024-10-14 19:08:53,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 983 transitions. [2024-10-14 19:08:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 19:08:53,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:53,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:53,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:08:53,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:53,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr521ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:53,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1812468573, now seen corresponding path program 1 times [2024-10-14 19:08:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190068214] [2024-10-14 19:08:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:53,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:53,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:53,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:53,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:08:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:53,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:08:53,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:53,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:53,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:08:53,489 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 33 treesize of output 31 [2024-10-14 19:08:53,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:08:53,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-10-14 19:08:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:53,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:53,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:53,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190068214] [2024-10-14 19:08:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190068214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:08:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538275809] [2024-10-14 19:08:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:53,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:53,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:53,561 INFO L87 Difference]: Start difference. First operand 891 states and 983 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 19:08:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:55,097 INFO L93 Difference]: Finished difference Result 1769 states and 1956 transitions. [2024-10-14 19:08:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 19:08:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:55,101 INFO L225 Difference]: With dead ends: 1769 [2024-10-14 19:08:55,101 INFO L226 Difference]: Without dead ends: 1769 [2024-10-14 19:08:55,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:55,102 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 888 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:55,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 2363 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:08:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2024-10-14 19:08:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 893. [2024-10-14 19:08:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 453 states have (on average 2.1567328918322297) internal successors, (977), 887 states have internal predecessors, (977), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 985 transitions. [2024-10-14 19:08:55,121 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 985 transitions. Word has length 11 [2024-10-14 19:08:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:55,122 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 985 transitions. [2024-10-14 19:08:55,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 19:08:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 985 transitions. [2024-10-14 19:08:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:08:55,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:55,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:55,129 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 (7)] Forceful destruction successful, exit code 0 [2024-10-14 19:08:55,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:55,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -289986667, now seen corresponding path program 1 times [2024-10-14 19:08:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736209315] [2024-10-14 19:08:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:55,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:55,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:55,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:55,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:08:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:55,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:08:55,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:55,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:55,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736209315] [2024-10-14 19:08:55,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736209315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:55,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:55,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:08:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627430104] [2024-10-14 19:08:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:08:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:55,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:08:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:55,495 INFO L87 Difference]: Start difference. First operand 893 states and 985 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:55,999 INFO L93 Difference]: Finished difference Result 854 states and 945 transitions. [2024-10-14 19:08:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:08:56,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 19:08:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:56,003 INFO L225 Difference]: With dead ends: 854 [2024-10-14 19:08:56,004 INFO L226 Difference]: Without dead ends: 854 [2024-10-14 19:08:56,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:08:56,005 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 61 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:56,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1482 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:08:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-14 19:08:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2024-10-14 19:08:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 438 states have (on average 2.1392694063926943) internal successors, (937), 848 states have internal predecessors, (937), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 945 transitions. [2024-10-14 19:08:56,018 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 945 transitions. Word has length 15 [2024-10-14 19:08:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:56,018 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 945 transitions. [2024-10-14 19:08:56,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 945 transitions. [2024-10-14 19:08:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:08:56,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:56,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:56,025 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-14 19:08:56,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:56,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:56,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 495684495, now seen corresponding path program 1 times [2024-10-14 19:08:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:56,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717633956] [2024-10-14 19:08:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:56,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:56,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:56,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:56,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:08:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:56,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:08:56,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:56,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:56,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:56,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717633956] [2024-10-14 19:08:56,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717633956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:08:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571161758] [2024-10-14 19:08:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:56,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:56,394 INFO L87 Difference]: Start difference. First operand 854 states and 945 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:56,986 INFO L93 Difference]: Finished difference Result 839 states and 923 transitions. [2024-10-14 19:08:56,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:08:56,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 19:08:56,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:56,991 INFO L225 Difference]: With dead ends: 839 [2024-10-14 19:08:56,991 INFO L226 Difference]: Without dead ends: 839 [2024-10-14 19:08:56,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:56,991 INFO L432 NwaCegarLoop]: 731 mSDtfsCounter, 45 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:56,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2175 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:08:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-14 19:08:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2024-10-14 19:08:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 437 states have (on average 2.0938215102974826) internal successors, (915), 833 states have internal predecessors, (915), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 923 transitions. [2024-10-14 19:08:57,004 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 923 transitions. Word has length 17 [2024-10-14 19:08:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:57,004 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 923 transitions. [2024-10-14 19:08:57,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 923 transitions. [2024-10-14 19:08:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:08:57,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:57,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:57,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:08:57,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:57,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:57,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1089062237, now seen corresponding path program 1 times [2024-10-14 19:08:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403134658] [2024-10-14 19:08:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:57,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:57,210 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:57,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 19:08:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:57,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:08:57,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:57,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:08:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:57,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:57,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403134658] [2024-10-14 19:08:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403134658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:57,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:08:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543687892] [2024-10-14 19:08:57,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:57,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:57,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:57,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:57,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:57,439 INFO L87 Difference]: Start difference. First operand 839 states and 923 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:08:59,017 INFO L93 Difference]: Finished difference Result 1184 states and 1297 transitions. [2024-10-14 19:08:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:08:59,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 19:08:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:08:59,020 INFO L225 Difference]: With dead ends: 1184 [2024-10-14 19:08:59,020 INFO L226 Difference]: Without dead ends: 1184 [2024-10-14 19:08:59,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:08:59,020 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 772 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:08:59,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 954 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:08:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-10-14 19:08:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 835. [2024-10-14 19:08:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 437 states have (on average 2.0846681922196795) internal successors, (911), 829 states have internal predecessors, (911), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:08:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 919 transitions. [2024-10-14 19:08:59,032 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 919 transitions. Word has length 31 [2024-10-14 19:08:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:08:59,033 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 919 transitions. [2024-10-14 19:08:59,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:08:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 919 transitions. [2024-10-14 19:08:59,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:08:59,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:08:59,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:08:59,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 19:08:59,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:59,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:08:59,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:08:59,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1089062238, now seen corresponding path program 1 times [2024-10-14 19:08:59,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:08:59,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322877493] [2024-10-14 19:08:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:08:59,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:08:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:08:59,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:08:59,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 19:08:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:08:59,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:08:59,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:08:59,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:08:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:08:59,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:08:59,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:08:59,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322877493] [2024-10-14 19:08:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322877493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:08:59,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:08:59,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:08:59,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963007038] [2024-10-14 19:08:59,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:08:59,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:08:59,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:08:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:08:59,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:08:59,578 INFO L87 Difference]: Start difference. First operand 835 states and 919 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:01,508 INFO L93 Difference]: Finished difference Result 1241 states and 1321 transitions. [2024-10-14 19:09:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:09:01,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 19:09:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:01,511 INFO L225 Difference]: With dead ends: 1241 [2024-10-14 19:09:01,511 INFO L226 Difference]: Without dead ends: 1241 [2024-10-14 19:09:01,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:09:01,512 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 561 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:01,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1246 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 19:09:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-10-14 19:09:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 831. [2024-10-14 19:09:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 437 states have (on average 2.0755148741418763) internal successors, (907), 825 states have internal predecessors, (907), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:09:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 915 transitions. [2024-10-14 19:09:01,524 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 915 transitions. Word has length 31 [2024-10-14 19:09:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:01,524 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 915 transitions. [2024-10-14 19:09:01,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 915 transitions. [2024-10-14 19:09:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 19:09:01,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:01,529 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] [2024-10-14 19:09:01,534 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-14 19:09:01,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:01,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:01,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 180022231, now seen corresponding path program 1 times [2024-10-14 19:09:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:01,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672597004] [2024-10-14 19:09:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:09:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:01,733 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:01,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 19:09:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:09:01,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:09:01,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:01,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:09:01,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:01,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672597004] [2024-10-14 19:09:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672597004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:09:01,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:09:01,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:09:01,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988651715] [2024-10-14 19:09:01,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:09:01,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:09:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:09:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:09:01,955 INFO L87 Difference]: Start difference. First operand 831 states and 915 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:02,525 INFO L93 Difference]: Finished difference Result 825 states and 905 transitions. [2024-10-14 19:09:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:09:02,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-10-14 19:09:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:02,529 INFO L225 Difference]: With dead ends: 825 [2024-10-14 19:09:02,529 INFO L226 Difference]: Without dead ends: 825 [2024-10-14 19:09:02,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:09:02,530 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 15 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:02,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2158 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:09:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-14 19:09:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 825. [2024-10-14 19:09:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 431 states have (on average 2.0812064965197217) internal successors, (897), 819 states have internal predecessors, (897), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:09:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 905 transitions. [2024-10-14 19:09:02,546 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 905 transitions. Word has length 47 [2024-10-14 19:09:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:02,546 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 905 transitions. [2024-10-14 19:09:02,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 905 transitions. [2024-10-14 19:09:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 19:09:02,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:02,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:09:02,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 19:09:02,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:02,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:02,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1008097448, now seen corresponding path program 1 times [2024-10-14 19:09:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:02,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760431427] [2024-10-14 19:09:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:09:02,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:02,750 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:02,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 19:09:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:09:02,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:09:02,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:03,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:09:03,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760431427] [2024-10-14 19:09:03,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760431427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:09:03,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:09:03,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:09:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464434543] [2024-10-14 19:09:03,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:09:03,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:09:03,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:03,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:09:03,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:09:03,252 INFO L87 Difference]: Start difference. First operand 825 states and 905 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:03,872 INFO L93 Difference]: Finished difference Result 1132 states and 1254 transitions. [2024-10-14 19:09:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:09:03,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2024-10-14 19:09:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:03,875 INFO L225 Difference]: With dead ends: 1132 [2024-10-14 19:09:03,876 INFO L226 Difference]: Without dead ends: 1132 [2024-10-14 19:09:03,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:09:03,876 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 278 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:03,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1562 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:09:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-14 19:09:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 998. [2024-10-14 19:09:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 604 states have (on average 2.0298013245033113) internal successors, (1226), 992 states have internal predecessors, (1226), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:09:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1234 transitions. [2024-10-14 19:09:03,891 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1234 transitions. Word has length 51 [2024-10-14 19:09:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:03,892 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1234 transitions. [2024-10-14 19:09:03,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1234 transitions. [2024-10-14 19:09:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 19:09:03,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:03,893 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-14 19:09:03,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 19:09:04,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:04,094 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:04,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1927177814, now seen corresponding path program 1 times [2024-10-14 19:09:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:04,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867831040] [2024-10-14 19:09:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:09:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:04,096 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:04,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 19:09:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:09:04,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:09:04,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:04,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:09:04,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:09:04,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:09:04,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:09:04,847 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:09:04,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:09:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:04,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:09:04,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867831040] [2024-10-14 19:09:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867831040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:09:04,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:09:04,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:09:04,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119075287] [2024-10-14 19:09:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:09:04,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:09:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:04,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:09:04,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:09:04,864 INFO L87 Difference]: Start difference. First operand 998 states and 1234 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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-14 19:09:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:06,500 INFO L93 Difference]: Finished difference Result 1368 states and 1729 transitions. [2024-10-14 19:09:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:09:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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-14 19:09:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:06,504 INFO L225 Difference]: With dead ends: 1368 [2024-10-14 19:09:06,504 INFO L226 Difference]: Without dead ends: 1368 [2024-10-14 19:09:06,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:09:06,504 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1090 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:06,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 342 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:09:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-10-14 19:09:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 933. [2024-10-14 19:09:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 577 states have (on average 1.9480069324090121) internal successors, (1124), 927 states have internal predecessors, (1124), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:09:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1132 transitions. [2024-10-14 19:09:06,517 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1132 transitions. Word has length 54 [2024-10-14 19:09:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1132 transitions. [2024-10-14 19:09:06,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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-14 19:09:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1132 transitions. [2024-10-14 19:09:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:09:06,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:06,518 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] [2024-10-14 19:09:06,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 19:09:06,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:06,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash -697317610, now seen corresponding path program 1 times [2024-10-14 19:09:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:06,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016353223] [2024-10-14 19:09:06,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:09:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:06,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:06,725 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:06,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 19:09:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:09:06,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:09:06,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:06,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:09:06,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:09:06,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 19:09:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:06,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:09:06,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:06,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016353223] [2024-10-14 19:09:06,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016353223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:09:06,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:09:06,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:09:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467013556] [2024-10-14 19:09:06,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:09:06,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:09:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:09:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:09:06,988 INFO L87 Difference]: Start difference. First operand 933 states and 1132 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:08,528 INFO L93 Difference]: Finished difference Result 932 states and 1131 transitions. [2024-10-14 19:09:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:09:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-14 19:09:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:08,531 INFO L225 Difference]: With dead ends: 932 [2024-10-14 19:09:08,531 INFO L226 Difference]: Without dead ends: 932 [2024-10-14 19:09:08,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-14 19:09:08,532 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 2 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:08,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1815 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:09:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-14 19:09:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-10-14 19:09:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 577 states have (on average 1.9462738301559792) internal successors, (1123), 926 states have internal predecessors, (1123), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:09:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1131 transitions. [2024-10-14 19:09:08,543 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1131 transitions. Word has length 58 [2024-10-14 19:09:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:08,544 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1131 transitions. [2024-10-14 19:09:08,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1131 transitions. [2024-10-14 19:09:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:09:08,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:08,545 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] [2024-10-14 19:09:08,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 19:09:08,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:08,745 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -697317609, now seen corresponding path program 1 times [2024-10-14 19:09:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762806018] [2024-10-14 19:09:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:09:08,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:08,748 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:08,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 19:09:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:09:08,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 19:09:08,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:08,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:09:08,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:09:09,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 19:09:09,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 19:09:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:09,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:09:09,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762806018] [2024-10-14 19:09:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762806018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:09:09,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:09:09,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:09:09,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780440967] [2024-10-14 19:09:09,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:09:09,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:09:09,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:09,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:09:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:09:09,040 INFO L87 Difference]: Start difference. First operand 932 states and 1131 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:10,884 INFO L93 Difference]: Finished difference Result 931 states and 1130 transitions. [2024-10-14 19:09:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:09:10,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-14 19:09:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:10,887 INFO L225 Difference]: With dead ends: 931 [2024-10-14 19:09:10,887 INFO L226 Difference]: Without dead ends: 931 [2024-10-14 19:09:10,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-14 19:09:10,888 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:10,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1853 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:09:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-10-14 19:09:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2024-10-14 19:09:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 576 states have (on average 1.9479166666666667) internal successors, (1122), 925 states have internal predecessors, (1122), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:09:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1130 transitions. [2024-10-14 19:09:10,903 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1130 transitions. Word has length 58 [2024-10-14 19:09:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:10,904 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1130 transitions. [2024-10-14 19:09:10,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:09:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1130 transitions. [2024-10-14 19:09:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 19:09:10,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:10,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:09:10,914 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-14 19:09:11,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:11,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:11,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1357344986, now seen corresponding path program 1 times [2024-10-14 19:09:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:11,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429097195] [2024-10-14 19:09:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:09:11,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:11,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:11,108 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:11,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 19:09:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:09:11,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:09:11,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:11,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:09:11,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429097195] [2024-10-14 19:09:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429097195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:09:11,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:09:11,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:09:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554549867] [2024-10-14 19:09:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:09:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:09:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:09:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:09:11,389 INFO L87 Difference]: Start difference. First operand 931 states and 1130 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:09:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:11,928 INFO L93 Difference]: Finished difference Result 933 states and 1133 transitions. [2024-10-14 19:09:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:09:11,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-14 19:09:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:11,934 INFO L225 Difference]: With dead ends: 933 [2024-10-14 19:09:11,934 INFO L226 Difference]: Without dead ends: 933 [2024-10-14 19:09:11,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:09:11,935 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 0 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:11,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2094 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:09:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-10-14 19:09:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2024-10-14 19:09:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 577 states have (on average 1.9480069324090121) internal successors, (1124), 927 states have internal predecessors, (1124), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:09:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1133 transitions. [2024-10-14 19:09:11,955 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1133 transitions. Word has length 64 [2024-10-14 19:09:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:11,956 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1133 transitions. [2024-10-14 19:09:11,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:09:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1133 transitions. [2024-10-14 19:09:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:09:11,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:11,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:09:11,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 19:09:12,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:12,158 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:12,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1218431584, now seen corresponding path program 1 times [2024-10-14 19:09:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:12,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549455087] [2024-10-14 19:09:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:09:12,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:12,162 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:12,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 19:09:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:09:12,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:09:12,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:12,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:09:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:12,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549455087] [2024-10-14 19:09:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549455087] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:09:12,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:09:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:09:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917314056] [2024-10-14 19:09:12,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:09:12,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:09:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:09:12,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:09:12,486 INFO L87 Difference]: Start difference. First operand 933 states and 1133 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-14 19:09:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:13,365 INFO L93 Difference]: Finished difference Result 942 states and 1147 transitions. [2024-10-14 19:09:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:09:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2024-10-14 19:09:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:13,368 INFO L225 Difference]: With dead ends: 942 [2024-10-14 19:09:13,369 INFO L226 Difference]: Without dead ends: 942 [2024-10-14 19:09:13,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 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-14 19:09:13,369 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 4 mSDsluCounter, 2785 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:13,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3483 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:09:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-10-14 19:09:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 941. [2024-10-14 19:09:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 584 states have (on average 1.946917808219178) internal successors, (1137), 934 states have internal predecessors, (1137), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:09:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1146 transitions. [2024-10-14 19:09:13,378 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1146 transitions. Word has length 65 [2024-10-14 19:09:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:13,379 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1146 transitions. [2024-10-14 19:09:13,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-14 19:09:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1146 transitions. [2024-10-14 19:09:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 19:09:13,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:13,380 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:09:13,390 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-14 19:09:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:13,581 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:13,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1957334438, now seen corresponding path program 2 times [2024-10-14 19:09:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:13,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084943503] [2024-10-14 19:09:13,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:09:13,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:13,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:13,583 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:13,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 19:09:13,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:09:13,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:09:13,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:09:13,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:13,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:09:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:14,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084943503] [2024-10-14 19:09:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084943503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:09:14,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:09:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:09:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489520775] [2024-10-14 19:09:14,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:09:14,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:09:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:09:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:09:14,150 INFO L87 Difference]: Start difference. First operand 941 states and 1146 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-14 19:09:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:15,390 INFO L93 Difference]: Finished difference Result 953 states and 1165 transitions. [2024-10-14 19:09:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:09:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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 68 [2024-10-14 19:09:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:15,393 INFO L225 Difference]: With dead ends: 953 [2024-10-14 19:09:15,394 INFO L226 Difference]: Without dead ends: 951 [2024-10-14 19:09:15,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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-14 19:09:15,394 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 7 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:15,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4183 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:09:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-10-14 19:09:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 950. [2024-10-14 19:09:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 593 states have (on average 1.9376053962900506) internal successors, (1149), 943 states have internal predecessors, (1149), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:09:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1158 transitions. [2024-10-14 19:09:15,406 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1158 transitions. Word has length 68 [2024-10-14 19:09:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:15,406 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1158 transitions. [2024-10-14 19:09:15,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-14 19:09:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1158 transitions. [2024-10-14 19:09:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 19:09:15,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:15,407 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:09:15,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-14 19:09:15,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:15,608 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:15,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash 3837082, now seen corresponding path program 3 times [2024-10-14 19:09:15,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:15,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734086447] [2024-10-14 19:09:15,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:09:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:15,610 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:15,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 19:09:16,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:09:16,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:09:16,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:09:16,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:16,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:09:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:16,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:16,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734086447] [2024-10-14 19:09:16,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734086447] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:09:16,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:09:16,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:09:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993825492] [2024-10-14 19:09:16,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:09:16,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:09:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:16,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:09:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:09:16,735 INFO L87 Difference]: Start difference. First operand 950 states and 1158 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-14 19:09:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:20,199 INFO L93 Difference]: Finished difference Result 971 states and 1194 transitions. [2024-10-14 19:09:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:09:20,200 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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 74 [2024-10-14 19:09:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:20,203 INFO L225 Difference]: With dead ends: 971 [2024-10-14 19:09:20,203 INFO L226 Difference]: Without dead ends: 968 [2024-10-14 19:09:20,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:09:20,204 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 13 mSDsluCounter, 9752 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10450 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:20,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10450 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 19:09:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-10-14 19:09:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2024-10-14 19:09:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 611 states have (on average 1.9181669394435352) internal successors, (1172), 961 states have internal predecessors, (1172), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:09:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1181 transitions. [2024-10-14 19:09:20,218 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1181 transitions. Word has length 74 [2024-10-14 19:09:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:20,218 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1181 transitions. [2024-10-14 19:09:20,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-14 19:09:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1181 transitions. [2024-10-14 19:09:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 19:09:20,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:20,219 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:09:20,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-14 19:09:20,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:20,420 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:20,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1170387226, now seen corresponding path program 4 times [2024-10-14 19:09:20,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:20,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812096381] [2024-10-14 19:09:20,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:09:20,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:20,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:20,422 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:20,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 19:09:20,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:09:20,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:09:20,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 19:09:20,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:21,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:09:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:09:22,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:22,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812096381] [2024-10-14 19:09:22,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812096381] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:09:22,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:09:22,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:09:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107724584] [2024-10-14 19:09:22,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:09:22,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:09:22,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:09:22,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:09:22,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:09:22,658 INFO L87 Difference]: Start difference. First operand 968 states and 1181 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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-14 19:09:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:09:31,250 INFO L93 Difference]: Finished difference Result 1005 states and 1249 transitions. [2024-10-14 19:09:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:09:31,251 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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 86 [2024-10-14 19:09:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:09:31,254 INFO L225 Difference]: With dead ends: 1005 [2024-10-14 19:09:31,254 INFO L226 Difference]: Without dead ends: 1002 [2024-10-14 19:09:31,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:09:31,256 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 25 mSDsluCounter, 16721 mSDsCounter, 0 mSdLazyCounter, 4131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 17419 SdHoareTripleChecker+Invalid, 4161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:09:31,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 17419 Invalid, 4161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4131 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-14 19:09:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2024-10-14 19:09:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2024-10-14 19:09:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 645 states have (on average 1.8837209302325582) internal successors, (1215), 995 states have internal predecessors, (1215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:09:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1224 transitions. [2024-10-14 19:09:31,269 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1224 transitions. Word has length 86 [2024-10-14 19:09:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:09:31,269 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1224 transitions. [2024-10-14 19:09:31,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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-14 19:09:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1224 transitions. [2024-10-14 19:09:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 19:09:31,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:09:31,271 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:09:31,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-14 19:09:31,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:09:31,471 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-14 19:09:31,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:09:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1192509786, now seen corresponding path program 5 times [2024-10-14 19:09:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:09:31,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976663790] [2024-10-14 19:09:31,472 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:09:31,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-14 19:09:31,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:09:31,474 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:09:31,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 (22)] Waiting until timeout for monitored process [2024-10-14 19:09:32,538 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:09:32,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:09:32,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 19:09:32,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:32,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:09:32,651 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:09:32,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-14 19:09:32,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:09:32,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 19:09:33,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:09:33,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-14 19:09:33,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-14 19:09:33,618 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-14 19:09:33,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:09:33,899 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2000) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-10-14 19:09:33,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:09:33,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976663790] [2024-10-14 19:09:33,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976663790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:09:33,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [122643740] [2024-10-14 19:09:33,901 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:09:33,901 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:09:33,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:09:33,903 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:09:33,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-10-14 19:09:34,405 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:09:34,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:09:34,450 WARN L253 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 615 conjuncts are in the unsatisfiable core [2024-10-14 19:09:34,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:09:34,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:09:34,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:09:34,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:34,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:34,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:34,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:09:34,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:09:34,596 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:09:34,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:09:34,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:09:34,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:34,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:34,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:34,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:09:34,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2024-10-14 19:09:35,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:09:35,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:35,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:35,235 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:09:35,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205 [2024-10-14 19:09:51,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:09:51,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 149885 treesize of output 118989