./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:40:13,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:40:13,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:40:13,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:40:13,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:40:13,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:40:13,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:40:13,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:40:13,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:40:13,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:40:13,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:40:13,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:40:13,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:40:13,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:40:13,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:40:13,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:40:13,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:40:13,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:40:13,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:40:13,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:40:13,195 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:40:13,198 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:40:13,198 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:40:13,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:40:13,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:40:13,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:40:13,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:40:13,199 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:40:13,199 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:40:13,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:40:13,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:40:13,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:40:13,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:40:13,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:40:13,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:40:13,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:40:13,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:40:13,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:40:13,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:40:13,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:40:13,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:40:13,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:40:13,203 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2024-11-22 21:40:13,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:40:13,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:40:13,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:40:13,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:40:13,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:40:13,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-22 21:40:14,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:40:15,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:40:15,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-22 21:40:15,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ae4c9ee/c9ad751900944517998a0867dae9a27c/FLAG0129ad3c2 [2024-11-22 21:40:15,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ae4c9ee/c9ad751900944517998a0867dae9a27c [2024-11-22 21:40:15,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:40:15,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:40:15,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:40:15,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:40:15,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:40:15,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:15" (1/1) ... [2024-11-22 21:40:15,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193576a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:15, skipping insertion in model container [2024-11-22 21:40:15,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:15" (1/1) ... [2024-11-22 21:40:15,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:40:15,452 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:15,453 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:15,453 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:15,454 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:15,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:40:15,521 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-22 21:40:15,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ba765a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:15, skipping insertion in model container [2024-11-22 21:40:15,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:40:15,523 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 21:40:15,525 INFO L158 Benchmark]: Toolchain (without parser) took 469.54ms. Allocated memory is still 199.2MB. Free memory was 170.0MB in the beginning and 150.2MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 21:40:15,525 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:40:15,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.52ms. Allocated memory is still 199.2MB. Free memory was 170.0MB in the beginning and 150.2MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 21:40:15,527 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 151.0MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.52ms. Allocated memory is still 199.2MB. Free memory was 170.0MB in the beginning and 150.2MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1051]: 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 ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:40:17,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:40:17,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:40:17,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:40:17,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:40:17,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:40:17,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:40:17,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:40:17,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:40:17,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:40:17,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:40:17,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:40:17,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:40:17,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:40:17,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:40:17,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:40:17,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:40:17,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:40:17,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:40:17,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:40:17,491 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:40:17,493 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:40:17,494 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:40:17,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:40:17,494 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:40:17,494 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:40:17,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:40:17,495 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:40:17,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:40:17,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:40:17,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:40:17,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:40:17,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:40:17,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:40:17,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:40:17,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:40:17,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:40:17,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:40:17,499 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:40:17,499 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:40:17,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:40:17,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:40:17,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:40:17,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:40:17,500 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2024-11-22 21:40:17,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:40:17,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:40:17,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:40:17,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:40:17,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:40:17,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-22 21:40:19,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:40:19,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:40:19,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-22 21:40:19,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc08666e/a27c8dec95da41f9ba18d1dd43f2d0d4/FLAG2900e5c0a [2024-11-22 21:40:19,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc08666e/a27c8dec95da41f9ba18d1dd43f2d0d4 [2024-11-22 21:40:19,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:40:19,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:40:19,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:40:19,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:40:19,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:40:19,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:19" (1/1) ... [2024-11-22 21:40:19,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a821d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:19, skipping insertion in model container [2024-11-22 21:40:19,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:19" (1/1) ... [2024-11-22 21:40:19,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:40:20,001 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,002 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,002 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,002 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:40:20,070 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 21:40:20,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:40:20,119 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,119 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,123 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,124 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:40:20,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:40:20,209 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,209 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,210 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,210 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-22 21:40:20,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:40:20,286 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:40:20,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20 WrapperNode [2024-11-22 21:40:20,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:40:20,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:40:20,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:40:20,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:40:20,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,354 INFO L138 Inliner]: procedures = 284, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 313 [2024-11-22 21:40:20,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:40:20,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:40:20,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:40:20,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:40:20,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,414 INFO L175 MemorySlicer]: Split 110 memory accesses to 4 slices as follows [2, 5, 2, 101]. 92 percent of accesses are in the largest equivalence class. The 87 initializations are split as follows [2, 5, 0, 80]. The 13 writes are split as follows [0, 0, 1, 12]. [2024-11-22 21:40:20,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:40:20,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:40:20,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:40:20,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:40:20,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (1/1) ... [2024-11-22 21:40:20,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:40:20,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:40:20,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:40:20,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:40:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 21:40:20,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 21:40:20,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 21:40:20,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 21:40:20,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 21:40:20,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-22 21:40:20,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-22 21:40:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-22 21:40:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-22 21:40:20,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:40:20,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:40:20,548 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:40:20,741 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:40:20,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:40:21,397 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:40:21,398 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:40:22,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:40:22,656 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-22 21:40:22,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:40:22 BoogieIcfgContainer [2024-11-22 21:40:22,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:40:22,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:40:22,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:40:22,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:40:22,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:40:19" (1/3) ... [2024-11-22 21:40:22,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dff1ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:40:22, skipping insertion in model container [2024-11-22 21:40:22,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:20" (2/3) ... [2024-11-22 21:40:22,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dff1ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:40:22, skipping insertion in model container [2024-11-22 21:40:22,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:40:22" (3/3) ... [2024-11-22 21:40:22,663 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2024-11-22 21:40:22,676 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:40:22,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-11-22 21:40:22,676 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:40:22,751 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-22 21:40:22,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 133 transitions, 273 flow [2024-11-22 21:40:22,840 INFO L124 PetriNetUnfolderBase]: 18/145 cut-off events. [2024-11-22 21:40:22,840 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-22 21:40:22,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 145 events. 18/145 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 530 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-11-22 21:40:22,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 133 transitions, 273 flow [2024-11-22 21:40:22,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 133 transitions, 273 flow [2024-11-22 21:40:22,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:40:22,857 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;@d3ec777, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:40:22,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-11-22 21:40:22,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:40:22,865 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-22 21:40:22,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:40:22,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:22,870 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:40:22,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash 852780, now seen corresponding path program 1 times [2024-11-22 21:40:22,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85237926] [2024-11-22 21:40:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:22,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:22,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:22,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:22,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 21:40:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:23,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:40:23,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:23,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:23,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:23,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85237926] [2024-11-22 21:40:23,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85237926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:23,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:23,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:40:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004150020] [2024-11-22 21:40:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:40:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:23,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:40:23,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:40:23,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-11-22 21:40:23,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 133 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:23,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:23,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-11-22 21:40:23,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:23,644 INFO L124 PetriNetUnfolderBase]: 125/490 cut-off events. [2024-11-22 21:40:23,645 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-22 21:40:23,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 490 events. 125/490 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2675 event pairs, 64 based on Foata normal form. 52/431 useless extension candidates. Maximal degree in co-relation 675. Up to 177 conditions per place. [2024-11-22 21:40:23,649 INFO L140 encePairwiseOnDemand]: 112/133 looper letters, 66 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2024-11-22 21:40:23,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 425 flow [2024-11-22 21:40:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:40:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:40:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2024-11-22 21:40:23,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7048872180451128 [2024-11-22 21:40:23,661 INFO L175 Difference]: Start difference. First operand has 118 places, 133 transitions, 273 flow. Second operand 4 states and 375 transitions. [2024-11-22 21:40:23,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 425 flow [2024-11-22 21:40:23,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:40:23,667 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 253 flow [2024-11-22 21:40:23,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2024-11-22 21:40:23,671 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-22 21:40:23,671 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 253 flow [2024-11-22 21:40:23,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:23,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:23,671 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:40:23,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 21:40:23,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:23,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 852781, now seen corresponding path program 1 times [2024-11-22 21:40:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765116112] [2024-11-22 21:40:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:23,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:23,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:23,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:23,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 21:40:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:24,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 21:40:24,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:24,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:24,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765116112] [2024-11-22 21:40:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765116112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:24,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:40:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256185573] [2024-11-22 21:40:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:24,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:40:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:24,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:40:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:40:24,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 133 [2024-11-22 21:40:24,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:24,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:24,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 133 [2024-11-22 21:40:24,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:24,476 INFO L124 PetriNetUnfolderBase]: 127/521 cut-off events. [2024-11-22 21:40:24,477 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-11-22 21:40:24,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 521 events. 127/521 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2796 event pairs, 105 based on Foata normal form. 3/410 useless extension candidates. Maximal degree in co-relation 743. Up to 274 conditions per place. [2024-11-22 21:40:24,480 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 47 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2024-11-22 21:40:24,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 371 flow [2024-11-22 21:40:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:40:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:40:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2024-11-22 21:40:24,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6447368421052632 [2024-11-22 21:40:24,483 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 253 flow. Second operand 4 states and 343 transitions. [2024-11-22 21:40:24,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 371 flow [2024-11-22 21:40:24,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 359 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:40:24,486 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 286 flow [2024-11-22 21:40:24,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2024-11-22 21:40:24,486 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-22 21:40:24,487 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 286 flow [2024-11-22 21:40:24,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:24,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:24,487 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:40:24,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 21:40:24,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:24,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:24,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash -363827024, now seen corresponding path program 1 times [2024-11-22 21:40:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:24,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202903361] [2024-11-22 21:40:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:24,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:24,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:24,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:24,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 21:40:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:24,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:40:24,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:24,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:40:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:24,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:24,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202903361] [2024-11-22 21:40:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202903361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:40:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041149065] [2024-11-22 21:40:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:24,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:40:24,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:40:24,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:40:24,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-11-22 21:40:24,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:24,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:24,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-11-22 21:40:24,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:25,100 INFO L124 PetriNetUnfolderBase]: 127/520 cut-off events. [2024-11-22 21:40:25,101 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-22 21:40:25,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 520 events. 127/520 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2810 event pairs, 105 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 811. Up to 270 conditions per place. [2024-11-22 21:40:25,103 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-11-22 21:40:25,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 380 flow [2024-11-22 21:40:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:40:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:40:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-22 21:40:25,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-11-22 21:40:25,105 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 286 flow. Second operand 3 states and 270 transitions. [2024-11-22 21:40:25,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 380 flow [2024-11-22 21:40:25,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:40:25,108 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 287 flow [2024-11-22 21:40:25,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2024-11-22 21:40:25,109 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-22 21:40:25,109 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 287 flow [2024-11-22 21:40:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:25,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:25,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:40:25,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:40:25,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:25,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:25,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:25,311 INFO L85 PathProgramCache]: Analyzing trace with hash -363827023, now seen corresponding path program 1 times [2024-11-22 21:40:25,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:25,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135946471] [2024-11-22 21:40:25,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:25,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:25,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:25,314 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:25,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 21:40:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:25,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:40:25,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:25,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:40:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:25,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:25,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135946471] [2024-11-22 21:40:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135946471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:40:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692677526] [2024-11-22 21:40:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:25,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:40:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:40:25,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:40:25,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-11-22 21:40:25,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:25,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:25,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-11-22 21:40:25,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:25,771 INFO L124 PetriNetUnfolderBase]: 127/519 cut-off events. [2024-11-22 21:40:25,772 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-22 21:40:25,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 519 events. 127/519 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2810 event pairs, 105 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 810. Up to 270 conditions per place. [2024-11-22 21:40:25,774 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2024-11-22 21:40:25,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 381 flow [2024-11-22 21:40:25,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:40:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:40:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-22 21:40:25,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-11-22 21:40:25,776 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 287 flow. Second operand 3 states and 270 transitions. [2024-11-22 21:40:25,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 381 flow [2024-11-22 21:40:25,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:40:25,778 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 285 flow [2024-11-22 21:40:25,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2024-11-22 21:40:25,779 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-22 21:40:25,779 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 285 flow [2024-11-22 21:40:25,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:25,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:25,780 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-22 21:40:25,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 21:40:25,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:25,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:25,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1606269168, now seen corresponding path program 1 times [2024-11-22 21:40:25,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:25,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106738762] [2024-11-22 21:40:25,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:25,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:25,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:25,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:25,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 21:40:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:26,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:40:26,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:26,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:26,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106738762] [2024-11-22 21:40:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106738762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:26,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:40:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299978836] [2024-11-22 21:40:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:26,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:40:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:40:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:40:26,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-22 21:40:26,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:26,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:26,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-22 21:40:26,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:26,317 INFO L124 PetriNetUnfolderBase]: 126/541 cut-off events. [2024-11-22 21:40:26,317 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-22 21:40:26,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 541 events. 126/541 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2814 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 841. Up to 270 conditions per place. [2024-11-22 21:40:26,319 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 49 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-22 21:40:26,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 401 flow [2024-11-22 21:40:26,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:40:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:40:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-22 21:40:26,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2024-11-22 21:40:26,321 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 285 flow. Second operand 3 states and 278 transitions. [2024-11-22 21:40:26,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 401 flow [2024-11-22 21:40:26,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 122 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:40:26,324 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 290 flow [2024-11-22 21:40:26,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2024-11-22 21:40:26,324 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-22 21:40:26,325 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 290 flow [2024-11-22 21:40:26,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:26,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:26,325 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:26,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 21:40:26,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:26,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:26,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1606265027, now seen corresponding path program 1 times [2024-11-22 21:40:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972066864] [2024-11-22 21:40:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:26,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:26,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:26,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:26,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 21:40:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:26,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:40:26,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:26,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:40:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:26,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:26,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:26,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972066864] [2024-11-22 21:40:26,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972066864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:26,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:26,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:40:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094191117] [2024-11-22 21:40:26,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:26,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:40:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:40:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:40:26,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-22 21:40:26,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:26,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:26,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-22 21:40:26,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:27,211 INFO L124 PetriNetUnfolderBase]: 126/537 cut-off events. [2024-11-22 21:40:27,211 INFO L125 PetriNetUnfolderBase]: For 33/34 co-relation queries the response was YES. [2024-11-22 21:40:27,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 537 events. 126/537 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2790 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 837. Up to 274 conditions per place. [2024-11-22 21:40:27,218 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 46 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2024-11-22 21:40:27,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 386 flow [2024-11-22 21:40:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:40:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:40:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-11-22 21:40:27,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-11-22 21:40:27,220 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 290 flow. Second operand 4 states and 332 transitions. [2024-11-22 21:40:27,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 386 flow [2024-11-22 21:40:27,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:40:27,225 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 291 flow [2024-11-22 21:40:27,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2024-11-22 21:40:27,226 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-22 21:40:27,226 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 291 flow [2024-11-22 21:40:27,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:27,226 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:27,227 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:27,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 21:40:27,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:27,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:27,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1606265026, now seen corresponding path program 1 times [2024-11-22 21:40:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:27,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206663746] [2024-11-22 21:40:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:27,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:27,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:27,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:27,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 21:40:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:27,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:40:27,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:27,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:40:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:27,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:27,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206663746] [2024-11-22 21:40:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206663746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:27,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:40:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711038106] [2024-11-22 21:40:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:27,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:40:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:40:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:40:27,696 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-11-22 21:40:27,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:27,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:27,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-11-22 21:40:27,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:27,941 INFO L124 PetriNetUnfolderBase]: 126/533 cut-off events. [2024-11-22 21:40:27,941 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-22 21:40:27,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 533 events. 126/533 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2787 event pairs, 105 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 841. Up to 272 conditions per place. [2024-11-22 21:40:27,944 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 43 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2024-11-22 21:40:27,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 114 transitions, 387 flow [2024-11-22 21:40:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:40:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:40:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2024-11-22 21:40:27,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909774436090226 [2024-11-22 21:40:27,946 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 291 flow. Second operand 5 states and 393 transitions. [2024-11-22 21:40:27,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 114 transitions, 387 flow [2024-11-22 21:40:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 379 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:40:27,948 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 293 flow [2024-11-22 21:40:27,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2024-11-22 21:40:27,949 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-22 21:40:27,949 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 293 flow [2024-11-22 21:40:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:27,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:27,950 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:27,956 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 (8)] Forceful destruction successful, exit code 0 [2024-11-22 21:40:28,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:28,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1727458735, now seen corresponding path program 1 times [2024-11-22 21:40:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:28,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008364013] [2024-11-22 21:40:28,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:28,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:28,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:28,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:28,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 21:40:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:28,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 21:40:28,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:28,822 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 21:40:28,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-22 21:40:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:28,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:28,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008364013] [2024-11-22 21:40:28,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008364013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:28,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:28,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:40:28,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447846914] [2024-11-22 21:40:28,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:28,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:40:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:28,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:40:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:40:29,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-22 21:40:29,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:29,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:29,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-22 21:40:29,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:29,255 INFO L124 PetriNetUnfolderBase]: 125/503 cut-off events. [2024-11-22 21:40:29,255 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-11-22 21:40:29,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 503 events. 125/503 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2609 event pairs, 64 based on Foata normal form. 2/397 useless extension candidates. Maximal degree in co-relation 813. Up to 180 conditions per place. [2024-11-22 21:40:29,257 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 67 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2024-11-22 21:40:29,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 479 flow [2024-11-22 21:40:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:40:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:40:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2024-11-22 21:40:29,259 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6654135338345865 [2024-11-22 21:40:29,259 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 293 flow. Second operand 4 states and 354 transitions. [2024-11-22 21:40:29,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 479 flow [2024-11-22 21:40:29,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 465 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:40:29,262 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 285 flow [2024-11-22 21:40:29,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2024-11-22 21:40:29,263 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2024-11-22 21:40:29,263 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 285 flow [2024-11-22 21:40:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:29,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:29,263 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:29,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 21:40:29,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:29,468 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:29,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1727458736, now seen corresponding path program 1 times [2024-11-22 21:40:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:29,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356764290] [2024-11-22 21:40:29,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:29,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:29,472 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:29,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 21:40:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:30,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 21:40:30,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:30,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:40:30,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 21:40:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:30,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:30,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:30,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356764290] [2024-11-22 21:40:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356764290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:40:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552485733] [2024-11-22 21:40:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:30,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:40:30,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:30,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:40:30,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:40:30,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-22 21:40:30,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:30,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:30,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-22 21:40:30,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:30,871 INFO L124 PetriNetUnfolderBase]: 128/561 cut-off events. [2024-11-22 21:40:30,872 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2024-11-22 21:40:30,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 561 events. 128/561 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3030 event pairs, 106 based on Foata normal form. 2/435 useless extension candidates. Maximal degree in co-relation 857. Up to 281 conditions per place. [2024-11-22 21:40:30,874 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 53 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2024-11-22 21:40:30,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 431 flow [2024-11-22 21:40:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:40:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:40:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2024-11-22 21:40:30,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6409774436090225 [2024-11-22 21:40:30,876 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 285 flow. Second operand 4 states and 341 transitions. [2024-11-22 21:40:30,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 431 flow [2024-11-22 21:40:30,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 119 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:40:30,879 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 321 flow [2024-11-22 21:40:30,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2024-11-22 21:40:30,881 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-22 21:40:30,881 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 321 flow [2024-11-22 21:40:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:30,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:30,882 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:30,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-22 21:40:31,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:31,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:31,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2011614171, now seen corresponding path program 1 times [2024-11-22 21:40:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454391128] [2024-11-22 21:40:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:31,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:31,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:31,094 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:31,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 21:40:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:31,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 21:40:31,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:31,968 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 11 treesize of output 7 [2024-11-22 21:40:31,973 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 11 treesize of output 7 [2024-11-22 21:40:32,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-22 21:40:32,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-22 21:40:32,090 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 21:40:32,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 21:40:32,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 21:40:32,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-22 21:40:32,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-22 21:40:32,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-22 21:40:32,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-22 21:40:32,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-22 21:40:32,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-22 21:40:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:32,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:32,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:32,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454391128] [2024-11-22 21:40:32,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454391128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:32,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:32,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:40:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078723332] [2024-11-22 21:40:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:32,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:40:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:40:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:40:33,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 133 [2024-11-22 21:40:33,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 321 flow. Second operand has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:33,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:33,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 133 [2024-11-22 21:40:33,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:34,310 INFO L124 PetriNetUnfolderBase]: 128/560 cut-off events. [2024-11-22 21:40:34,310 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-11-22 21:40:34,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 560 events. 128/560 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3013 event pairs, 106 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 868. Up to 294 conditions per place. [2024-11-22 21:40:34,313 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 68 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2024-11-22 21:40:34,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 132 transitions, 517 flow [2024-11-22 21:40:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:40:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:40:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 695 transitions. [2024-11-22 21:40:34,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4750512645249487 [2024-11-22 21:40:34,317 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 321 flow. Second operand 11 states and 695 transitions. [2024-11-22 21:40:34,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 132 transitions, 517 flow [2024-11-22 21:40:34,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 132 transitions, 515 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:40:34,323 INFO L231 Difference]: Finished difference. Result has 131 places, 121 transitions, 377 flow [2024-11-22 21:40:34,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=377, PETRI_PLACES=131, PETRI_TRANSITIONS=121} [2024-11-22 21:40:34,326 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2024-11-22 21:40:34,326 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 121 transitions, 377 flow [2024-11-22 21:40:34,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:34,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:34,327 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:34,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-22 21:40:34,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:34,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:34,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:34,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2011614170, now seen corresponding path program 1 times [2024-11-22 21:40:34,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:34,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244866381] [2024-11-22 21:40:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:34,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:34,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:34,531 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:34,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 21:40:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:35,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 21:40:35,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:35,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 21:40:35,410 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2024-11-22 21:40:35,519 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-22 21:40:35,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-11-22 21:40:35,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-11-22 21:40:35,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-11-22 21:40:35,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-22 21:40:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:35,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:35,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244866381] [2024-11-22 21:40:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244866381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:35,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:35,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:40:35,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672066938] [2024-11-22 21:40:35,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:35,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:40:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:35,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:40:35,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:40:37,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 133 [2024-11-22 21:40:37,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 121 transitions, 377 flow. Second operand has 10 states, 10 states have (on average 63.0) internal successors, (630), 10 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:37,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:37,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 133 [2024-11-22 21:40:37,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:37,939 INFO L124 PetriNetUnfolderBase]: 126/530 cut-off events. [2024-11-22 21:40:37,939 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2024-11-22 21:40:37,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 530 events. 126/530 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2866 event pairs, 64 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 877. Up to 192 conditions per place. [2024-11-22 21:40:37,941 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 75 selfloop transitions, 20 changer transitions 0/152 dead transitions. [2024-11-22 21:40:37,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 152 transitions, 639 flow [2024-11-22 21:40:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:40:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:40:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 766 transitions. [2024-11-22 21:40:37,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5235816814764184 [2024-11-22 21:40:37,946 INFO L175 Difference]: Start difference. First operand has 131 places, 121 transitions, 377 flow. Second operand 11 states and 766 transitions. [2024-11-22 21:40:37,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 152 transitions, 639 flow [2024-11-22 21:40:37,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 152 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:40:37,949 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 465 flow [2024-11-22 21:40:37,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=465, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2024-11-22 21:40:37,950 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-22 21:40:37,950 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 465 flow [2024-11-22 21:40:37,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.0) internal successors, (630), 10 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:37,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:37,951 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:37,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-22 21:40:38,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:38,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:38,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:38,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2064469345, now seen corresponding path program 1 times [2024-11-22 21:40:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:38,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357035668] [2024-11-22 21:40:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:38,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:38,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:38,155 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:38,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 21:40:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:38,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 21:40:38,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:38,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:40:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:38,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:38,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357035668] [2024-11-22 21:40:38,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357035668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:38,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:38,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:40:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900687017] [2024-11-22 21:40:38,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:38,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:40:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:40:38,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:40:38,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 133 [2024-11-22 21:40:38,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:38,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:38,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 133 [2024-11-22 21:40:38,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:38,743 INFO L124 PetriNetUnfolderBase]: 127/548 cut-off events. [2024-11-22 21:40:38,743 INFO L125 PetriNetUnfolderBase]: For 121/122 co-relation queries the response was YES. [2024-11-22 21:40:38,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 548 events. 127/548 cut-off events. For 121/122 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2935 event pairs, 105 based on Foata normal form. 8/447 useless extension candidates. Maximal degree in co-relation 928. Up to 271 conditions per place. [2024-11-22 21:40:38,746 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 48 selfloop transitions, 11 changer transitions 0/124 dead transitions. [2024-11-22 21:40:38,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 124 transitions, 579 flow [2024-11-22 21:40:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:40:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:40:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 338 transitions. [2024-11-22 21:40:38,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6353383458646616 [2024-11-22 21:40:38,747 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 465 flow. Second operand 4 states and 338 transitions. [2024-11-22 21:40:38,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 124 transitions, 579 flow [2024-11-22 21:40:38,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 124 transitions, 555 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-22 21:40:38,750 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 459 flow [2024-11-22 21:40:38,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-11-22 21:40:38,751 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-11-22 21:40:38,751 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 459 flow [2024-11-22 21:40:38,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:38,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:38,751 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:38,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 21:40:38,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:38,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:38,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:38,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2064469346, now seen corresponding path program 1 times [2024-11-22 21:40:38,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:38,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277491086] [2024-11-22 21:40:38,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:38,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:38,960 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:38,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 21:40:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:39,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 21:40:39,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:39,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:40:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:39,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:40:39,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277491086] [2024-11-22 21:40:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277491086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:40:39,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:40:39,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:40:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59595745] [2024-11-22 21:40:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:40:39,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:40:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:40:39,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:40:39,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-22 21:40:39,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:39,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:39,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-22 21:40:39,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:39,511 INFO L124 PetriNetUnfolderBase]: 127/540 cut-off events. [2024-11-22 21:40:39,512 INFO L125 PetriNetUnfolderBase]: For 117/118 co-relation queries the response was YES. [2024-11-22 21:40:39,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 540 events. 127/540 cut-off events. For 117/118 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2895 event pairs, 105 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 905. Up to 271 conditions per place. [2024-11-22 21:40:39,514 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 50 selfloop transitions, 11 changer transitions 0/122 dead transitions. [2024-11-22 21:40:39,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 122 transitions, 577 flow [2024-11-22 21:40:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:40:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:40:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-11-22 21:40:39,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-11-22 21:40:39,516 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 459 flow. Second operand 4 states and 332 transitions. [2024-11-22 21:40:39,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 122 transitions, 577 flow [2024-11-22 21:40:39,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 122 transitions, 555 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:40:39,518 INFO L231 Difference]: Finished difference. Result has 138 places, 122 transitions, 455 flow [2024-11-22 21:40:39,518 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=455, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2024-11-22 21:40:39,519 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 20 predicate places. [2024-11-22 21:40:39,519 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 455 flow [2024-11-22 21:40:39,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:39,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:39,519 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:39,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-22 21:40:39,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:39,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:39,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1089690184, now seen corresponding path program 1 times [2024-11-22 21:40:39,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643068936] [2024-11-22 21:40:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:39,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:39,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:39,722 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:39,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 21:40:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:39,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:40:39,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:39,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:40:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:39,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643068936] [2024-11-22 21:40:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643068936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:40:39,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:40:39,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-22 21:40:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819946149] [2024-11-22 21:40:39,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:40:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:40:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:39,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:40:39,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:40:39,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-22 21:40:39,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:39,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:39,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-22 21:40:39,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:40,267 INFO L124 PetriNetUnfolderBase]: 127/590 cut-off events. [2024-11-22 21:40:40,268 INFO L125 PetriNetUnfolderBase]: For 212/213 co-relation queries the response was YES. [2024-11-22 21:40:40,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 590 events. 127/590 cut-off events. For 212/213 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3029 event pairs, 105 based on Foata normal form. 6/494 useless extension candidates. Maximal degree in co-relation 968. Up to 267 conditions per place. [2024-11-22 21:40:40,270 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 63 selfloop transitions, 11 changer transitions 0/137 dead transitions. [2024-11-22 21:40:40,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 715 flow [2024-11-22 21:40:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:40:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:40:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2024-11-22 21:40:40,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.650375939849624 [2024-11-22 21:40:40,272 INFO L175 Difference]: Start difference. First operand has 138 places, 122 transitions, 455 flow. Second operand 6 states and 519 transitions. [2024-11-22 21:40:40,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 715 flow [2024-11-22 21:40:40,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 671 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:40:40,275 INFO L231 Difference]: Finished difference. Result has 144 places, 127 transitions, 521 flow [2024-11-22 21:40:40,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=521, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2024-11-22 21:40:40,276 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-22 21:40:40,276 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 521 flow [2024-11-22 21:40:40,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:40,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:40:40,276 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:40:40,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 21:40:40,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:40,480 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:40:40,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:40:40,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1719973357, now seen corresponding path program 1 times [2024-11-22 21:40:40,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:40:40,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272180094] [2024-11-22 21:40:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:40:40,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:40:40,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:40:40,484 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:40:40,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 21:40:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:40:41,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-22 21:40:41,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:40:41,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:40:41,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 7 [2024-11-22 21:40:41,548 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 11 treesize of output 7 [2024-11-22 21:40:41,553 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 15 treesize of output 1 [2024-11-22 21:40:41,596 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2024-11-22 21:40:41,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-22 21:40:41,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-22 21:40:41,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 21:40:41,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-22 21:40:41,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 21:40:41,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-22 21:40:41,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-22 21:40:41,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 21:40:41,731 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 17 treesize of output 9 [2024-11-22 21:40:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:40:41,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:40:41,816 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_578) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-22 21:40:41,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_578) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-22 21:40:41,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:40:41,989 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2024-11-22 21:40:41,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:40:41,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2024-11-22 21:40:42,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:40:42,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78 treesize of output 81 [2024-11-22 21:40:42,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:40:42,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 124 treesize of output 118 [2024-11-22 21:40:42,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 21 [2024-11-22 21:40:42,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 [2024-11-22 21:40:42,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:40:42,700 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2024-11-22 21:40:42,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:40:42,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 58 [2024-11-22 21:40:42,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 11 [2024-11-22 21:40:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-22 21:40:44,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:40:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272180094] [2024-11-22 21:40:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272180094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:40:44,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:40:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-22 21:40:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573819464] [2024-11-22 21:40:44,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:40:44,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 21:40:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:40:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 21:40:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=175, Unknown=2, NotChecked=54, Total=272 [2024-11-22 21:40:44,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 133 [2024-11-22 21:40:44,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 521 flow. Second operand has 17 states, 17 states have (on average 22.235294117647058) internal successors, (378), 17 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:40:44,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:40:44,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 133 [2024-11-22 21:40:44,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:40:50,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:40:54,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:40:59,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:40:59,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_578) |c_~#c~0.base|) .cse0)))) (or (let ((.cse1 (bvadd (_ bv12 32) |c_ULTIMATE.start_new_~p~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (or (forall ((v_ArrVal_572 (_ BitVec 32))) (bvule .cse1 (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_572) |c_ULTIMATE.start_new_~p~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|))))) (or (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|)))) (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_new_~p~0#1.offset|) .cse1)) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (or (forall ((v_ArrVal_572 (_ BitVec 32))) (let ((.cse2 (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_572))) (or (bvule .cse1 (select .cse2 |c_ULTIMATE.start_new_~p~0#1.base|)) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) v_arrayElimCell_37) (select .cse2 v_arrayElimCell_36)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|))))))) (forall ((|~#c~0.base| (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |~#c~0.base|)))))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-22 21:41:05,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:41:06,833 INFO L124 PetriNetUnfolderBase]: 465/1264 cut-off events. [2024-11-22 21:41:06,833 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-22 21:41:06,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 1264 events. 465/1264 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7516 event pairs, 422 based on Foata normal form. 6/843 useless extension candidates. Maximal degree in co-relation 2384. Up to 951 conditions per place. [2024-11-22 21:41:06,837 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 92 selfloop transitions, 29 changer transitions 0/141 dead transitions. [2024-11-22 21:41:06,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 141 transitions, 817 flow [2024-11-22 21:41:06,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 21:41:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-22 21:41:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 516 transitions. [2024-11-22 21:41:06,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.19398496240601504 [2024-11-22 21:41:06,840 INFO L175 Difference]: Start difference. First operand has 144 places, 127 transitions, 521 flow. Second operand 20 states and 516 transitions. [2024-11-22 21:41:06,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 141 transitions, 817 flow [2024-11-22 21:41:06,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 141 transitions, 793 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-11-22 21:41:06,843 INFO L231 Difference]: Finished difference. Result has 164 places, 133 transitions, 601 flow [2024-11-22 21:41:06,844 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=601, PETRI_PLACES=164, PETRI_TRANSITIONS=133} [2024-11-22 21:41:06,844 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 46 predicate places. [2024-11-22 21:41:06,844 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 133 transitions, 601 flow [2024-11-22 21:41:06,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 22.235294117647058) internal successors, (378), 17 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:06,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:41:06,844 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:41:06,853 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-11-22 21:41:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:07,049 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:41:07,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:41:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1719973358, now seen corresponding path program 1 times [2024-11-22 21:41:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:41:07,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763772913] [2024-11-22 21:41:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:41:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:41:07,051 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:41:07,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 21:41:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:41:08,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 21:41:08,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:41:08,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:41:08,150 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 25 treesize of output 1 [2024-11-22 21:41:08,212 INFO L349 Elim1Store]: treesize reduction 90, result has 31.3 percent of original size [2024-11-22 21:41:08,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 61 [2024-11-22 21:41:08,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2024-11-22 21:41:08,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2024-11-22 21:41:08,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-22 21:41:08,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 21:41:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:41:08,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:41:08,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_681) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-11-22 21:41:08,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:41:08,756 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-22 21:41:08,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:41:08,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 57 [2024-11-22 21:41:08,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 [2024-11-22 21:41:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-22 21:41:09,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:41:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763772913] [2024-11-22 21:41:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763772913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:41:09,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:41:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-22 21:41:09,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120689037] [2024-11-22 21:41:09,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:41:09,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 21:41:09,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:41:09,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 21:41:09,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=160, Unknown=13, NotChecked=26, Total=240 [2024-11-22 21:41:10,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 133 [2024-11-22 21:41:10,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 133 transitions, 601 flow. Second operand has 16 states, 16 states have (on average 32.125) internal successors, (514), 16 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:10,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:41:10,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 133 [2024-11-22 21:41:10,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:41:12,950 INFO L124 PetriNetUnfolderBase]: 329/1030 cut-off events. [2024-11-22 21:41:12,950 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2024-11-22 21:41:12,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2085 conditions, 1030 events. 329/1030 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6081 event pairs, 292 based on Foata normal form. 6/805 useless extension candidates. Maximal degree in co-relation 1891. Up to 679 conditions per place. [2024-11-22 21:41:12,963 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 79 selfloop transitions, 28 changer transitions 0/137 dead transitions. [2024-11-22 21:41:12,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 137 transitions, 827 flow [2024-11-22 21:41:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:41:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:41:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 415 transitions. [2024-11-22 21:41:12,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2836637047163363 [2024-11-22 21:41:12,966 INFO L175 Difference]: Start difference. First operand has 164 places, 133 transitions, 601 flow. Second operand 11 states and 415 transitions. [2024-11-22 21:41:12,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 137 transitions, 827 flow [2024-11-22 21:41:12,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 137 transitions, 707 flow, removed 20 selfloop flow, removed 15 redundant places. [2024-11-22 21:41:12,970 INFO L231 Difference]: Finished difference. Result has 158 places, 132 transitions, 533 flow [2024-11-22 21:41:12,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=533, PETRI_PLACES=158, PETRI_TRANSITIONS=132} [2024-11-22 21:41:12,971 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2024-11-22 21:41:12,971 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 132 transitions, 533 flow [2024-11-22 21:41:12,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 32.125) internal successors, (514), 16 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:12,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:41:12,972 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:41:12,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 21:41:13,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:13,177 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:41:13,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:41:13,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1036305720, now seen corresponding path program 1 times [2024-11-22 21:41:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:41:13,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987884668] [2024-11-22 21:41:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:41:13,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:13,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:41:13,179 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:41:13,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-22 21:41:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:41:13,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:41:13,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:41:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:41:13,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:41:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:41:13,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:41:13,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987884668] [2024-11-22 21:41:13,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987884668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:41:13,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:41:13,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 21:41:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915242325] [2024-11-22 21:41:13,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:41:13,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:41:13,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:41:13,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:41:13,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:41:13,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-22 21:41:13,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 132 transitions, 533 flow. Second operand has 12 states, 12 states have (on average 79.91666666666667) internal successors, (959), 12 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:13,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:41:13,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-22 21:41:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:41:14,832 INFO L124 PetriNetUnfolderBase]: 127/698 cut-off events. [2024-11-22 21:41:14,833 INFO L125 PetriNetUnfolderBase]: For 419/420 co-relation queries the response was YES. [2024-11-22 21:41:14,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 698 events. 127/698 cut-off events. For 419/420 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2976 event pairs, 105 based on Foata normal form. 12/608 useless extension candidates. Maximal degree in co-relation 1116. Up to 267 conditions per place. [2024-11-22 21:41:14,835 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 120 selfloop transitions, 24 changer transitions 0/208 dead transitions. [2024-11-22 21:41:14,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 208 transitions, 1363 flow [2024-11-22 21:41:14,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:41:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 21:41:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1008 transitions. [2024-11-22 21:41:14,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2024-11-22 21:41:14,838 INFO L175 Difference]: Start difference. First operand has 158 places, 132 transitions, 533 flow. Second operand 12 states and 1008 transitions. [2024-11-22 21:41:14,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 208 transitions, 1363 flow [2024-11-22 21:41:14,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 208 transitions, 1189 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-11-22 21:41:14,842 INFO L231 Difference]: Finished difference. Result has 167 places, 146 transitions, 717 flow [2024-11-22 21:41:14,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=717, PETRI_PLACES=167, PETRI_TRANSITIONS=146} [2024-11-22 21:41:14,842 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 49 predicate places. [2024-11-22 21:41:14,843 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 146 transitions, 717 flow [2024-11-22 21:41:14,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.91666666666667) internal successors, (959), 12 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:14,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:41:14,843 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:41:14,856 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-11-22 21:41:15,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:15,044 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:41:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:41:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1106207288, now seen corresponding path program 2 times [2024-11-22 21:41:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:41:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926620685] [2024-11-22 21:41:15,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:41:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:15,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:41:15,047 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:41:15,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-22 21:41:17,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:41:17,447 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:41:17,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:41:17,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:41:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2024-11-22 21:41:17,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:41:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2024-11-22 21:41:17,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:41:17,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926620685] [2024-11-22 21:41:17,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926620685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:41:17,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:41:17,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-22 21:41:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111073225] [2024-11-22 21:41:17,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:41:17,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:41:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:41:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:41:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:41:17,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-22 21:41:17,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 146 transitions, 717 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:17,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:41:17,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-22 21:41:17,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:41:18,322 INFO L124 PetriNetUnfolderBase]: 129/935 cut-off events. [2024-11-22 21:41:18,322 INFO L125 PetriNetUnfolderBase]: For 1171/1172 co-relation queries the response was YES. [2024-11-22 21:41:18,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 935 events. 129/935 cut-off events. For 1171/1172 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2710 event pairs, 105 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1472. Up to 261 conditions per place. [2024-11-22 21:41:18,326 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 123 selfloop transitions, 6 changer transitions 0/193 dead transitions. [2024-11-22 21:41:18,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 193 transitions, 1430 flow [2024-11-22 21:41:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:41:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:41:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2024-11-22 21:41:18,329 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6616541353383458 [2024-11-22 21:41:18,329 INFO L175 Difference]: Start difference. First operand has 167 places, 146 transitions, 717 flow. Second operand 6 states and 528 transitions. [2024-11-22 21:41:18,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 193 transitions, 1430 flow [2024-11-22 21:41:18,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 193 transitions, 1406 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:41:18,335 INFO L231 Difference]: Finished difference. Result has 173 places, 149 transitions, 782 flow [2024-11-22 21:41:18,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=173, PETRI_TRANSITIONS=149} [2024-11-22 21:41:18,336 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 55 predicate places. [2024-11-22 21:41:18,336 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 149 transitions, 782 flow [2024-11-22 21:41:18,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:18,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:41:18,337 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-11-22 21:41:18,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-22 21:41:18,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:18,538 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:41:18,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:41:18,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1106207248, now seen corresponding path program 2 times [2024-11-22 21:41:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:41:18,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790856969] [2024-11-22 21:41:18,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:41:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:41:18,540 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:41:18,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 21:41:20,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:41:20,993 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:41:21,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 1704 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 21:41:21,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:41:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:41:21,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:41:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:41:21,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:41:21,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790856969] [2024-11-22 21:41:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790856969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:41:21,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:41:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-22 21:41:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401354419] [2024-11-22 21:41:21,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:41:21,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 21:41:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:41:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 21:41:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-11-22 21:41:21,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-22 21:41:21,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 149 transitions, 782 flow. Second operand has 24 states, 24 states have (on average 80.45833333333333) internal successors, (1931), 24 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:21,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:41:21,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-22 21:41:21,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:41:24,588 INFO L124 PetriNetUnfolderBase]: 129/1439 cut-off events. [2024-11-22 21:41:24,588 INFO L125 PetriNetUnfolderBase]: For 4342/4343 co-relation queries the response was YES. [2024-11-22 21:41:24,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3876 conditions, 1439 events. 129/1439 cut-off events. For 4342/4343 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2774 event pairs, 105 based on Foata normal form. 48/1386 useless extension candidates. Maximal degree in co-relation 3109. Up to 274 conditions per place. [2024-11-22 21:41:24,593 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 219 selfloop transitions, 48 changer transitions 0/331 dead transitions. [2024-11-22 21:41:24,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 331 transitions, 2516 flow [2024-11-22 21:41:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 21:41:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-22 21:41:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1986 transitions. [2024-11-22 21:41:24,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6221804511278195 [2024-11-22 21:41:24,596 INFO L175 Difference]: Start difference. First operand has 173 places, 149 transitions, 782 flow. Second operand 24 states and 1986 transitions. [2024-11-22 21:41:24,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 331 transitions, 2516 flow [2024-11-22 21:41:24,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 331 transitions, 2514 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:41:24,604 INFO L231 Difference]: Finished difference. Result has 208 places, 175 transitions, 1376 flow [2024-11-22 21:41:24,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1376, PETRI_PLACES=208, PETRI_TRANSITIONS=175} [2024-11-22 21:41:24,605 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 90 predicate places. [2024-11-22 21:41:24,605 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 175 transitions, 1376 flow [2024-11-22 21:41:24,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 80.45833333333333) internal successors, (1931), 24 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:41:24,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:41:24,606 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-11-22 21:41:24,632 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-11-22 21:41:24,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:24,806 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 21:41:24,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:41:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash -401431568, now seen corresponding path program 3 times [2024-11-22 21:41:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:41:24,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591687576] [2024-11-22 21:41:24,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:41:24,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:41:24,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:41:24,809 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:41:24,810 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