./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-dev-4a390ef-m [2024-10-24 19:12:49,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:12:49,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:12:49,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:12:49,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:12:49,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:12:49,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:12:49,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:12:49,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:12:49,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:12:49,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:12:49,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:12:49,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:12:49,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:12:49,425 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:12:49,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:12:49,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:12:49,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:12:49,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:12:49,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:12:49,426 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:12:49,426 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:12:49,426 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:12:49,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:12:49,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:12:49,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:12:49,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:12:49,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:12:49,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:12:49,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:12:49,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:12:49,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:12:49,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:12:49,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:12:49,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:12:49,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:12:49,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:12:49,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:12:49,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:12:49,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:12:49,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:12:49,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:12:49,431 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-10-24 19:12:49,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:12:49,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:12:49,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:12:49,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:12:49,682 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:12:49,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-10-24 19:12:51,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:12:51,324 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:12:51,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-10-24 19:12:51,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3d39684/434ba20fbfbd44c2809942cd4b012057/FLAGa91b255d7 [2024-10-24 19:12:51,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3d39684/434ba20fbfbd44c2809942cd4b012057 [2024-10-24 19:12:51,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:12:51,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:12:51,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:12:51,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:12:51,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:12:51,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:51" (1/1) ... [2024-10-24 19:12:51,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341fe0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:51, skipping insertion in model container [2024-10-24 19:12:51,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:51" (1/1) ... [2024-10-24 19:12:51,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:12:51,774 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:51,774 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:51,775 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:51,777 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:51,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:12:51,840 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 19:12:51,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1b14395d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:51, skipping insertion in model container [2024-10-24 19:12:51,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:12:51,842 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 19:12:51,844 INFO L158 Benchmark]: Toolchain (without parser) took 483.35ms. Allocated memory is still 216.0MB. Free memory was 147.2MB in the beginning and 129.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 19:12:51,844 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 119.5MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:12:51,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.26ms. Allocated memory is still 216.0MB. Free memory was 146.9MB in the beginning and 129.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 19:12:51,845 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.08ms. Allocated memory is still 119.5MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.26ms. Allocated memory is still 216.0MB. Free memory was 146.9MB in the beginning and 129.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. 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 /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-24 19:12:53,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:12:53,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 19:12:53,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:12:53,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:12:53,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:12:53,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:12:53,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:12:53,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:12:53,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:12:53,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:12:53,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:12:53,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:12:53,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:12:53,819 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:12:53,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:12:53,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:12:53,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:12:53,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:12:53,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:12:53,822 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:12:53,824 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:12:53,824 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:12:53,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:12:53,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:12:53,824 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:12:53,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:12:53,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:12:53,825 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:12:53,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:12:53,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:12:53,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:12:53,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:12:53,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:12:53,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:12:53,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:12:53,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:12:53,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:12:53,828 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:12:53,828 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:12:53,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:12:53,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:12:53,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:12:53,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:12:53,829 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:12:53,829 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-10-24 19:12:54,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:12:54,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:12:54,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:12:54,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:12:54,138 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:12:54,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-10-24 19:12:55,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:12:55,830 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:12:55,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-10-24 19:12:55,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d578f13/f8741a4d6b5346699b7f0a5731957296/FLAGb2f9203c1 [2024-10-24 19:12:55,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d578f13/f8741a4d6b5346699b7f0a5731957296 [2024-10-24 19:12:55,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:12:55,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:12:55,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:12:55,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:12:55,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:12:55,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:55" (1/1) ... [2024-10-24 19:12:55,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3b59e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:55, skipping insertion in model container [2024-10-24 19:12:55,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:12:55" (1/1) ... [2024-10-24 19:12:55,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:12:56,343 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,344 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,344 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,345 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:12:56,399 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 19:12:56,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:12:56,436 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,438 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,438 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,439 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:12:56,462 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:12:56,497 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,498 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,499 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,499 WARN L1660 CHandler]: Possible shadowing of function new [2024-10-24 19:12:56,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:12:56,559 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:12:56,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56 WrapperNode [2024-10-24 19:12:56,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:12:56,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:12:56,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:12:56,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:12:56,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,641 INFO L138 Inliner]: procedures = 283, calls = 56, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 235 [2024-10-24 19:12:56,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:12:56,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:12:56,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:12:56,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:12:56,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,691 INFO L175 MemorySlicer]: Split 32 memory accesses to 4 slices as follows [2, 5, 2, 23]. 72 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 15 writes are split as follows [0, 0, 1, 14]. [2024-10-24 19:12:56,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:12:56,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:12:56,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:12:56,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:12:56,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (1/1) ... [2024-10-24 19:12:56,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:12:56,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:12:56,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:12:56,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:12:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 19:12:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 19:12:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 19:12:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 19:12:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 19:12:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 19:12:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 19:12:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 19:12:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 19:12:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 19:12:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 19:12:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 19:12:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 19:12:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 19:12:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:12:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 19:12:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 19:12:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 19:12:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 19:12:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 19:12:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 19:12:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 19:12:56,814 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 19:12:56,814 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 19:12:56,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 19:12:56,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:12:56,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 19:12:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 19:12:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 19:12:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 19:12:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-24 19:12:56,817 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-24 19:12:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:12:56,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:12:56,818 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:12:56,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:12:57,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:12:57,594 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:12:57,595 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:12:57,780 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:12:57,780 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-24 19:12:57,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:12:57 BoogieIcfgContainer [2024-10-24 19:12:57,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:12:57,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:12:57,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:12:57,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:12:57,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:12:55" (1/3) ... [2024-10-24 19:12:57,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e628289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:12:57, skipping insertion in model container [2024-10-24 19:12:57,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:12:56" (2/3) ... [2024-10-24 19:12:57,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e628289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:12:57, skipping insertion in model container [2024-10-24 19:12:57,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:12:57" (3/3) ... [2024-10-24 19:12:57,793 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2024-10-24 19:12:57,819 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:12:57,823 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-10-24 19:12:57,823 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:12:57,914 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-24 19:12:57,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 133 transitions, 273 flow [2024-10-24 19:12:57,995 INFO L124 PetriNetUnfolderBase]: 18/145 cut-off events. [2024-10-24 19:12:57,995 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 19:12:57,998 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-10-24 19:12:57,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 133 transitions, 273 flow [2024-10-24 19:12:58,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 133 transitions, 273 flow [2024-10-24 19:12:58,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:12:58,021 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;@e299777, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:12:58,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-10-24 19:12:58,024 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:12:58,024 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-24 19:12:58,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:12:58,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:58,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:12:58,025 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-10-24 19:12:58,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash 697872, now seen corresponding path program 1 times [2024-10-24 19:12:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:58,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778730570] [2024-10-24 19:12:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:58,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:58,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:58,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:58,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 (2)] Waiting until timeout for monitored process [2024-10-24 19:12:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:12:58,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:12:58,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:12:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:12:58,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:12:58,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:12:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778730570] [2024-10-24 19:12:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778730570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:12:58,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:12:58,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:12:58,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783788261] [2024-10-24 19:12:58,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:12:58,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:12:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:12:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:12:58,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:12:58,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-10-24 19:12:58,380 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-10-24 19:12:58,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:12:58,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-10-24 19:12:58,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:12:58,669 INFO L124 PetriNetUnfolderBase]: 125/490 cut-off events. [2024-10-24 19:12:58,669 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-24 19:12:58,670 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-10-24 19:12:58,673 INFO L140 encePairwiseOnDemand]: 112/133 looper letters, 66 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2024-10-24 19:12:58,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 425 flow [2024-10-24 19:12:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:12:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:12:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2024-10-24 19:12:58,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7048872180451128 [2024-10-24 19:12:58,686 INFO L175 Difference]: Start difference. First operand has 118 places, 133 transitions, 273 flow. Second operand 4 states and 375 transitions. [2024-10-24 19:12:58,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 425 flow [2024-10-24 19:12:58,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 19:12:58,692 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 253 flow [2024-10-24 19:12:58,693 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-10-24 19:12:58,696 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-10-24 19:12:58,696 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 253 flow [2024-10-24 19:12:58,696 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-10-24 19:12:58,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:58,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:12:58,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 19:12:58,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:58,899 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-10-24 19:12:58,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash 697873, now seen corresponding path program 1 times [2024-10-24 19:12:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:58,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098064989] [2024-10-24 19:12:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:58,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:58,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:58,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 19:12:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:12:58,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 19:12:58,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:12:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:12:59,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:12:59,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:12:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098064989] [2024-10-24 19:12:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098064989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:12:59,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:12:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:12:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207433801] [2024-10-24 19:12:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:12:59,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:12:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:12:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:12:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:12:59,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 133 [2024-10-24 19:12:59,407 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-10-24 19:12:59,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:12:59,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 133 [2024-10-24 19:12:59,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:12:59,703 INFO L124 PetriNetUnfolderBase]: 127/521 cut-off events. [2024-10-24 19:12:59,703 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-10-24 19:12:59,705 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-10-24 19:12:59,708 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 47 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2024-10-24 19:12:59,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 371 flow [2024-10-24 19:12:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:12:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:12:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2024-10-24 19:12:59,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6447368421052632 [2024-10-24 19:12:59,711 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 253 flow. Second operand 4 states and 343 transitions. [2024-10-24 19:12:59,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 371 flow [2024-10-24 19:12:59,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 359 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:12:59,716 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 286 flow [2024-10-24 19:12:59,717 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-10-24 19:12:59,717 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-10-24 19:12:59,717 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 286 flow [2024-10-24 19:12:59,718 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-10-24 19:12:59,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:12:59,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:12:59,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 19:12:59,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:59,921 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-10-24 19:12:59,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:12:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash -683878864, now seen corresponding path program 1 times [2024-10-24 19:12:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:12:59,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407937317] [2024-10-24 19:12:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:12:59,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:12:59,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:12:59,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:12:59,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 19:13:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:00,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:13:00,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:00,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:13:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:00,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:00,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407937317] [2024-10-24 19:13:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407937317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:00,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:13:00,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484182091] [2024-10-24 19:13:00,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:00,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:13:00,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:00,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:13:00,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:13:00,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-10-24 19:13:00,219 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-10-24 19:13:00,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:00,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-10-24 19:13:00,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:00,375 INFO L124 PetriNetUnfolderBase]: 127/520 cut-off events. [2024-10-24 19:13:00,375 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-10-24 19:13:00,376 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-10-24 19:13:00,398 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-10-24 19:13:00,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 380 flow [2024-10-24 19:13:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:13:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:13:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-10-24 19:13:00,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-10-24 19:13:00,400 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 286 flow. Second operand 3 states and 270 transitions. [2024-10-24 19:13:00,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 380 flow [2024-10-24 19:13:00,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:13:00,403 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 287 flow [2024-10-24 19:13:00,403 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-10-24 19:13:00,404 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-10-24 19:13:00,404 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 287 flow [2024-10-24 19:13:00,404 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-10-24 19:13:00,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:00,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 19:13:00,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 19:13:00,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:00,608 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-10-24 19:13:00,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash -683878863, now seen corresponding path program 1 times [2024-10-24 19:13:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097489729] [2024-10-24 19:13:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:00,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:00,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:00,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:00,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 19:13:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:00,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:13:00,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:00,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 19:13:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:00,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:00,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:00,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097489729] [2024-10-24 19:13:00,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097489729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:00,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:00,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:13:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015336714] [2024-10-24 19:13:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:00,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:13:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:00,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:13:00,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:13:00,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-10-24 19:13:00,804 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-10-24 19:13:00,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:00,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-10-24 19:13:00,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:00,979 INFO L124 PetriNetUnfolderBase]: 127/519 cut-off events. [2024-10-24 19:13:00,980 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-10-24 19:13:00,981 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-10-24 19:13:00,990 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2024-10-24 19:13:00,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 381 flow [2024-10-24 19:13:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:13:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:13:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-10-24 19:13:00,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-10-24 19:13:00,992 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 287 flow. Second operand 3 states and 270 transitions. [2024-10-24 19:13:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 381 flow [2024-10-24 19:13:00,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:13:00,998 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 285 flow [2024-10-24 19:13:00,998 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-10-24 19:13:00,999 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-10-24 19:13:00,999 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 285 flow [2024-10-24 19:13:00,999 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-10-24 19:13:00,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:00,999 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 19:13:01,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 19:13:01,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:01,200 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-10-24 19:13:01,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash 274596564, now seen corresponding path program 1 times [2024-10-24 19:13:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001427370] [2024-10-24 19:13:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:01,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:01,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:01,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:01,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 19:13:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:01,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:13:01,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:01,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:01,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:01,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001427370] [2024-10-24 19:13:01,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001427370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:01,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:01,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:01,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402370019] [2024-10-24 19:13:01,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:01,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:13:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:01,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:13:01,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:13:01,280 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-10-24 19:13:01,280 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-10-24 19:13:01,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:01,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-10-24 19:13:01,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:01,501 INFO L124 PetriNetUnfolderBase]: 126/541 cut-off events. [2024-10-24 19:13:01,502 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-10-24 19:13:01,503 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-10-24 19:13:01,505 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 49 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-10-24 19:13:01,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 401 flow [2024-10-24 19:13:01,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:13:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:13:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-10-24 19:13:01,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2024-10-24 19:13:01,506 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 285 flow. Second operand 3 states and 278 transitions. [2024-10-24 19:13:01,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 401 flow [2024-10-24 19:13:01,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 122 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:13:01,510 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 290 flow [2024-10-24 19:13:01,510 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-10-24 19:13:01,511 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-10-24 19:13:01,511 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 290 flow [2024-10-24 19:13:01,511 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-10-24 19:13:01,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:01,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:01,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:01,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:01,715 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-10-24 19:13:01,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash 274592423, now seen corresponding path program 1 times [2024-10-24 19:13:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:01,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540277770] [2024-10-24 19:13:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:01,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:01,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:01,719 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:01,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 19:13:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:01,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 19:13:01,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:01,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 19:13:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:01,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:01,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540277770] [2024-10-24 19:13:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540277770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:01,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:01,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:01,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568922869] [2024-10-24 19:13:01,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:01,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:13:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:01,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:13:01,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:13:02,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-10-24 19:13:02,249 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-10-24 19:13:02,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:02,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-10-24 19:13:02,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:02,739 INFO L124 PetriNetUnfolderBase]: 126/537 cut-off events. [2024-10-24 19:13:02,743 INFO L125 PetriNetUnfolderBase]: For 33/34 co-relation queries the response was YES. [2024-10-24 19:13:02,744 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-10-24 19:13:02,746 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 46 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2024-10-24 19:13:02,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 386 flow [2024-10-24 19:13:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-10-24 19:13:02,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-10-24 19:13:02,751 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 290 flow. Second operand 4 states and 332 transitions. [2024-10-24 19:13:02,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 386 flow [2024-10-24 19:13:02,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:13:02,754 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 291 flow [2024-10-24 19:13:02,758 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-10-24 19:13:02,759 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-10-24 19:13:02,759 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 291 flow [2024-10-24 19:13:02,759 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-10-24 19:13:02,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:02,763 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:02,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 19:13:02,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:02,964 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-10-24 19:13:02,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash 274592422, now seen corresponding path program 1 times [2024-10-24 19:13:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841398691] [2024-10-24 19:13:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:02,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:02,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:02,970 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:02,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 19:13:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:03,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:13:03,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:13:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:03,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:03,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841398691] [2024-10-24 19:13:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841398691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914559059] [2024-10-24 19:13:03,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:03,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:13:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:03,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:13:03,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:13:03,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-10-24 19:13:03,182 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-10-24 19:13:03,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:03,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-10-24 19:13:03,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:03,415 INFO L124 PetriNetUnfolderBase]: 126/533 cut-off events. [2024-10-24 19:13:03,415 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-10-24 19:13:03,416 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-10-24 19:13:03,417 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 43 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2024-10-24 19:13:03,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 114 transitions, 387 flow [2024-10-24 19:13:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:13:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:13:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2024-10-24 19:13:03,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909774436090226 [2024-10-24 19:13:03,422 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 291 flow. Second operand 5 states and 393 transitions. [2024-10-24 19:13:03,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 114 transitions, 387 flow [2024-10-24 19:13:03,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 379 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:03,424 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 293 flow [2024-10-24 19:13:03,425 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-10-24 19:13:03,425 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-10-24 19:13:03,425 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 293 flow [2024-10-24 19:13:03,425 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-10-24 19:13:03,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:03,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:03,430 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-10-24 19:13:03,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:03,626 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-10-24 19:13:03,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1890335507, now seen corresponding path program 1 times [2024-10-24 19:13:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823526203] [2024-10-24 19:13:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:03,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:03,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:03,630 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:03,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 19:13:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:03,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 19:13:03,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:03,952 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 19:13:03,952 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-10-24 19:13:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:04,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:04,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823526203] [2024-10-24 19:13:04,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823526203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:04,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:04,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:13:04,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361061262] [2024-10-24 19:13:04,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:04,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:13:04,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:04,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:13:04,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:13:04,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-10-24 19:13:04,140 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-10-24 19:13:04,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:04,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-10-24 19:13:04,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:04,390 INFO L124 PetriNetUnfolderBase]: 125/503 cut-off events. [2024-10-24 19:13:04,390 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-10-24 19:13:04,392 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-10-24 19:13:04,396 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 67 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2024-10-24 19:13:04,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 479 flow [2024-10-24 19:13:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2024-10-24 19:13:04,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6654135338345865 [2024-10-24 19:13:04,397 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 293 flow. Second operand 4 states and 354 transitions. [2024-10-24 19:13:04,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 479 flow [2024-10-24 19:13:04,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 465 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:13:04,400 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 285 flow [2024-10-24 19:13:04,404 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-10-24 19:13:04,405 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2024-10-24 19:13:04,405 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 285 flow [2024-10-24 19:13:04,405 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-10-24 19:13:04,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:04,406 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:04,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 19:13:04,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:04,607 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-10-24 19:13:04,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1890335508, now seen corresponding path program 1 times [2024-10-24 19:13:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:04,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027878618] [2024-10-24 19:13:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:04,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:04,612 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:04,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 19:13:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:04,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 19:13:04,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:05,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 19:13:05,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 19:13:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:05,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:05,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027878618] [2024-10-24 19:13:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027878618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:05,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268858082] [2024-10-24 19:13:05,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:05,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:13:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:13:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:13:05,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-10-24 19:13:05,322 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-10-24 19:13:05,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:05,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-10-24 19:13:05,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:05,607 INFO L124 PetriNetUnfolderBase]: 128/561 cut-off events. [2024-10-24 19:13:05,607 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2024-10-24 19:13:05,608 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-10-24 19:13:05,609 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 53 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2024-10-24 19:13:05,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 431 flow [2024-10-24 19:13:05,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2024-10-24 19:13:05,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6409774436090225 [2024-10-24 19:13:05,610 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 285 flow. Second operand 4 states and 341 transitions. [2024-10-24 19:13:05,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 431 flow [2024-10-24 19:13:05,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 119 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:05,613 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 321 flow [2024-10-24 19:13:05,613 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-10-24 19:13:05,613 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-10-24 19:13:05,613 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 321 flow [2024-10-24 19:13:05,614 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-10-24 19:13:05,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:05,614 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:05,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 19:13:05,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:05,817 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-10-24 19:13:05,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1529140645, now seen corresponding path program 1 times [2024-10-24 19:13:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994262823] [2024-10-24 19:13:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:05,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:05,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:05,823 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:05,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 19:13:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:06,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 19:13:06,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:06,137 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 7 treesize of output 6 [2024-10-24 19:13:06,145 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 7 treesize of output 6 [2024-10-24 19:13:06,250 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 18 treesize of output 13 [2024-10-24 19:13:06,264 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 18 treesize of output 13 [2024-10-24 19:13:06,308 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 21 treesize of output 16 [2024-10-24 19:13:06,315 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 21 treesize of output 16 [2024-10-24 19:13:06,365 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 19:13:06,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 19:13:06,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 19:13:06,424 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 21 treesize of output 16 [2024-10-24 19:13:06,435 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 21 treesize of output 16 [2024-10-24 19:13:06,481 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 21 treesize of output 16 [2024-10-24 19:13:06,492 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 21 treesize of output 16 [2024-10-24 19:13:06,520 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 21 treesize of output 16 [2024-10-24 19:13:06,523 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 21 treesize of output 16 [2024-10-24 19:13:06,566 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 20 treesize of output 16 [2024-10-24 19:13:06,570 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 20 treesize of output 16 [2024-10-24 19:13:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:06,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:06,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:06,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994262823] [2024-10-24 19:13:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994262823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:06,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 19:13:06,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911814268] [2024-10-24 19:13:06,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:06,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:13:06,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:06,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:13:06,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:13:08,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 133 [2024-10-24 19:13:08,249 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-10-24 19:13:08,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:08,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 133 [2024-10-24 19:13:08,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:09,049 INFO L124 PetriNetUnfolderBase]: 128/560 cut-off events. [2024-10-24 19:13:09,049 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-10-24 19:13:09,050 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 3014 event pairs, 106 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 868. Up to 305 conditions per place. [2024-10-24 19:13:09,051 INFO L140 encePairwiseOnDemand]: 122/133 looper letters, 61 selfloop transitions, 10 changer transitions 0/124 dead transitions. [2024-10-24 19:13:09,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 124 transitions, 483 flow [2024-10-24 19:13:09,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:13:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:13:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 684 transitions. [2024-10-24 19:13:09,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-10-24 19:13:09,054 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 321 flow. Second operand 11 states and 684 transitions. [2024-10-24 19:13:09,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 124 transitions, 483 flow [2024-10-24 19:13:09,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:13:09,057 INFO L231 Difference]: Finished difference. Result has 131 places, 121 transitions, 375 flow [2024-10-24 19:13:09,058 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=375, PETRI_PLACES=131, PETRI_TRANSITIONS=121} [2024-10-24 19:13:09,058 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2024-10-24 19:13:09,058 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 121 transitions, 375 flow [2024-10-24 19:13:09,059 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-10-24 19:13:09,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:09,059 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:09,066 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-10-24 19:13:09,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:09,259 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-10-24 19:13:09,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1529140646, now seen corresponding path program 1 times [2024-10-24 19:13:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:09,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54954083] [2024-10-24 19:13:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:09,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:09,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:09,263 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:09,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 19:13:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:09,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 19:13:09,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:09,408 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 7 treesize of output 6 [2024-10-24 19:13:09,415 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 7 treesize of output 6 [2024-10-24 19:13:09,505 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 18 treesize of output 13 [2024-10-24 19:13:09,517 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 18 treesize of output 13 [2024-10-24 19:13:09,586 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 21 treesize of output 16 [2024-10-24 19:13:09,593 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 21 treesize of output 16 [2024-10-24 19:13:09,648 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-24 19:13:09,648 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-10-24 19:13:09,706 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 21 treesize of output 16 [2024-10-24 19:13:09,717 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 21 treesize of output 16 [2024-10-24 19:13:09,760 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 21 treesize of output 16 [2024-10-24 19:13:09,766 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 21 treesize of output 16 [2024-10-24 19:13:09,799 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 21 treesize of output 16 [2024-10-24 19:13:09,831 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 20 treesize of output 16 [2024-10-24 19:13:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:09,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:09,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:09,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54954083] [2024-10-24 19:13:09,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54954083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:09,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:09,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 19:13:09,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945199806] [2024-10-24 19:13:09,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:09,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:13:09,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:09,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:13:09,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:13:11,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 133 [2024-10-24 19:13:11,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 121 transitions, 375 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-10-24 19:13:11,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:11,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 133 [2024-10-24 19:13:11,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:11,880 INFO L124 PetriNetUnfolderBase]: 128/559 cut-off events. [2024-10-24 19:13:11,881 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2024-10-24 19:13:11,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 559 events. 128/559 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3002 event pairs, 106 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 912. Up to 299 conditions per place. [2024-10-24 19:13:11,884 INFO L140 encePairwiseOnDemand]: 122/133 looper letters, 57 selfloop transitions, 10 changer transitions 0/124 dead transitions. [2024-10-24 19:13:11,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 124 transitions, 515 flow [2024-10-24 19:13:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:13:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:13:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 746 transitions. [2024-10-24 19:13:11,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5099111414900889 [2024-10-24 19:13:11,886 INFO L175 Difference]: Start difference. First operand has 131 places, 121 transitions, 375 flow. Second operand 11 states and 746 transitions. [2024-10-24 19:13:11,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 124 transitions, 515 flow [2024-10-24 19:13:11,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 124 transitions, 507 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:11,888 INFO L231 Difference]: Finished difference. Result has 139 places, 121 transitions, 391 flow [2024-10-24 19:13:11,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=391, PETRI_PLACES=139, PETRI_TRANSITIONS=121} [2024-10-24 19:13:11,889 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 21 predicate places. [2024-10-24 19:13:11,889 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 121 transitions, 391 flow [2024-10-24 19:13:11,890 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-10-24 19:13:11,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:11,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:11,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 19:13:12,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:12,091 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-10-24 19:13:12,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:12,092 INFO L85 PathProgramCache]: Analyzing trace with hash -158719101, now seen corresponding path program 1 times [2024-10-24 19:13:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741111145] [2024-10-24 19:13:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:12,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:12,095 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:12,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 (13)] Waiting until timeout for monitored process [2024-10-24 19:13:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:12,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 19:13:12,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:12,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 19:13:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:12,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:12,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741111145] [2024-10-24 19:13:12,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741111145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:12,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:12,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589749065] [2024-10-24 19:13:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:12,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:13:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:12,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:13:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:13:12,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 133 [2024-10-24 19:13:12,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 121 transitions, 391 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-10-24 19:13:12,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:12,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 133 [2024-10-24 19:13:12,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:12,626 INFO L124 PetriNetUnfolderBase]: 127/549 cut-off events. [2024-10-24 19:13:12,626 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2024-10-24 19:13:12,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 549 events. 127/549 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2948 event pairs, 105 based on Foata normal form. 8/444 useless extension candidates. Maximal degree in co-relation 891. Up to 271 conditions per place. [2024-10-24 19:13:12,628 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 46 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2024-10-24 19:13:12,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 119 transitions, 497 flow [2024-10-24 19:13:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 338 transitions. [2024-10-24 19:13:12,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6353383458646616 [2024-10-24 19:13:12,630 INFO L175 Difference]: Start difference. First operand has 139 places, 121 transitions, 391 flow. Second operand 4 states and 338 transitions. [2024-10-24 19:13:12,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 119 transitions, 497 flow [2024-10-24 19:13:12,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 119 transitions, 477 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-10-24 19:13:12,632 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 385 flow [2024-10-24 19:13:12,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=385, PETRI_PLACES=130, PETRI_TRANSITIONS=119} [2024-10-24 19:13:12,633 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2024-10-24 19:13:12,633 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 385 flow [2024-10-24 19:13:12,633 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-10-24 19:13:12,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:12,633 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:12,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 19:13:12,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:12,838 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-10-24 19:13:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash -158719102, now seen corresponding path program 1 times [2024-10-24 19:13:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275876193] [2024-10-24 19:13:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:12,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:12,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:12,840 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:12,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 19:13:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:12,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 19:13:12,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:12,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:13:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:12,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:13:12,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:12,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275876193] [2024-10-24 19:13:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275876193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:13:12,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:13:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:13:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856509753] [2024-10-24 19:13:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:13:12,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:13:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:13:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:13:13,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-10-24 19:13:13,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 119 transitions, 385 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-10-24 19:13:13,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:13,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-10-24 19:13:13,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:13,313 INFO L124 PetriNetUnfolderBase]: 127/541 cut-off events. [2024-10-24 19:13:13,313 INFO L125 PetriNetUnfolderBase]: For 75/76 co-relation queries the response was YES. [2024-10-24 19:13:13,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 541 events. 127/541 cut-off events. For 75/76 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2920 event pairs, 105 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 900. Up to 271 conditions per place. [2024-10-24 19:13:13,315 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 48 selfloop transitions, 9 changer transitions 0/117 dead transitions. [2024-10-24 19:13:13,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 117 transitions, 495 flow [2024-10-24 19:13:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:13:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:13:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-10-24 19:13:13,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-10-24 19:13:13,317 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 385 flow. Second operand 4 states and 332 transitions. [2024-10-24 19:13:13,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 117 transitions, 495 flow [2024-10-24 19:13:13,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 117 transitions, 477 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:13,319 INFO L231 Difference]: Finished difference. Result has 128 places, 117 transitions, 381 flow [2024-10-24 19:13:13,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=128, PETRI_TRANSITIONS=117} [2024-10-24 19:13:13,320 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2024-10-24 19:13:13,320 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 117 transitions, 381 flow [2024-10-24 19:13:13,320 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-10-24 19:13:13,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:13,320 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:13,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 19:13:13,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:13,524 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-10-24 19:13:13,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1322027448, now seen corresponding path program 1 times [2024-10-24 19:13:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918623172] [2024-10-24 19:13:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:13,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:13,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:13,528 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:13,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 19:13:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:13,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:13:13,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:13,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:13,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918623172] [2024-10-24 19:13:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918623172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:13,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:13,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-24 19:13:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40790640] [2024-10-24 19:13:13,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:13,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:13:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:13,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:13:13,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:13:13,742 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-10-24 19:13:13,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 117 transitions, 381 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-10-24 19:13:13,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:13,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-10-24 19:13:13,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:14,040 INFO L124 PetriNetUnfolderBase]: 127/591 cut-off events. [2024-10-24 19:13:14,040 INFO L125 PetriNetUnfolderBase]: For 151/152 co-relation queries the response was YES. [2024-10-24 19:13:14,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 591 events. 127/591 cut-off events. For 151/152 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3048 event pairs, 105 based on Foata normal form. 6/488 useless extension candidates. Maximal degree in co-relation 1018. Up to 267 conditions per place. [2024-10-24 19:13:14,064 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 63 selfloop transitions, 11 changer transitions 0/136 dead transitions. [2024-10-24 19:13:14,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 651 flow [2024-10-24 19:13:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:13:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:13:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2024-10-24 19:13:14,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.650375939849624 [2024-10-24 19:13:14,066 INFO L175 Difference]: Start difference. First operand has 128 places, 117 transitions, 381 flow. Second operand 6 states and 519 transitions. [2024-10-24 19:13:14,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 651 flow [2024-10-24 19:13:14,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 136 transitions, 607 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:14,069 INFO L231 Difference]: Finished difference. Result has 134 places, 122 transitions, 449 flow [2024-10-24 19:13:14,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=134, PETRI_TRANSITIONS=122} [2024-10-24 19:13:14,069 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2024-10-24 19:13:14,069 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 122 transitions, 449 flow [2024-10-24 19:13:14,070 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-10-24 19:13:14,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:14,070 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:14,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-24 19:13:14,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:14,274 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-10-24 19:13:14,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash -453080841, now seen corresponding path program 1 times [2024-10-24 19:13:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:14,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476825865] [2024-10-24 19:13:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:14,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:14,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:14,277 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:14,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 19:13:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:14,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-24 19:13:14,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:14,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 19:13:14,789 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-10-24 19:13:14,794 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-10-24 19:13:14,831 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-24 19:13:14,831 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 16 treesize of output 18 [2024-10-24 19:13:14,844 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 19:13:14,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 19:13:14,880 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-10-24 19:13:14,895 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 18 treesize of output 13 [2024-10-24 19:13:14,934 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 18 treesize of output 13 [2024-10-24 19:13:14,943 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-10-24 19:13:14,959 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-10-24 19:13:14,965 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 18 treesize of output 13 [2024-10-24 19:13:15,008 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 17 treesize of output 9 [2024-10-24 19:13:15,012 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 7 treesize of output 3 [2024-10-24 19:13:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:15,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:15,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_633) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (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_633) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_632) |c_~#c~0.base|) .cse1)))))) is different from false [2024-10-24 19:13:15,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:15,466 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 112 treesize of output 113 [2024-10-24 19:13:15,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:15,476 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 104 treesize of output 89 [2024-10-24 19:13:15,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:15,498 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 127 [2024-10-24 19:13:15,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:15,532 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 194 treesize of output 170 [2024-10-24 19:13:15,543 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 95 treesize of output 88 [2024-10-24 19:13:15,551 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 88 treesize of output 81 [2024-10-24 19:13:15,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:15,590 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 90 treesize of output 114 [2024-10-24 19:13:15,599 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 77 treesize of output 63 [2024-10-24 19:13:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 19:13:16,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476825865] [2024-10-24 19:13:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476825865] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:16,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:16,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-10-24 19:13:16,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457330457] [2024-10-24 19:13:16,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:16,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 19:13:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 19:13:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=192, Unknown=10, NotChecked=28, Total=272 [2024-10-24 19:13:17,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 133 [2024-10-24 19:13:17,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 122 transitions, 449 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-10-24 19:13:17,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:17,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 133 [2024-10-24 19:13:17,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:20,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (.cse0 (bvadd (_ bv12 32) |c_ULTIMATE.start_new_~p~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| (_ bv12 32)) |c_ULTIMATE.start_new_~p~0#1.base|))) (forall ((v_ArrVal_633 (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_633) |c_~#c~0.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (let ((.cse3 (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| (_ bv12 32)))) (or (bvule .cse0 (select .cse3 |c_ULTIMATE.start_new_~p~0#1.base|)) (bvule (bvadd (_ bv8 32) v_arrayElimCell_47) (select .cse3 v_arrayElimCell_46))))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (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_633) |c_~#c~0.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_632) |c_~#c~0.base|) .cse2)))) (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_new_~p~0#1.offset|) .cse0))) is different from false [2024-10-24 19:13:20,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (.cse2 (bvadd (_ bv12 32) |c_ULTIMATE.start_new_~p~0#1.offset|))) (and (forall ((v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_633) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (bvule .cse2 (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| (_ bv12 32)) |c_ULTIMATE.start_new_~p~0#1.base|))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (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_633) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_632) |c_~#c~0.base|) .cse1)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (let ((.cse3 (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| (_ bv12 32)))) (or (bvule .cse2 (select .cse3 |c_ULTIMATE.start_new_~p~0#1.base|)) (bvule (bvadd (_ bv8 32) v_arrayElimCell_47) (select .cse3 v_arrayElimCell_46))))) (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_new_~p~0#1.offset|) .cse2))) is different from false [2024-10-24 19:13:22,462 INFO L124 PetriNetUnfolderBase]: 465/1265 cut-off events. [2024-10-24 19:13:22,462 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-10-24 19:13:22,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 1265 events. 465/1265 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7540 event pairs, 422 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 2437. Up to 951 conditions per place. [2024-10-24 19:13:22,468 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 96 selfloop transitions, 28 changer transitions 0/144 dead transitions. [2024-10-24 19:13:22,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 775 flow [2024-10-24 19:13:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 19:13:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-24 19:13:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 499 transitions. [2024-10-24 19:13:22,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.19746735259200635 [2024-10-24 19:13:22,473 INFO L175 Difference]: Start difference. First operand has 134 places, 122 transitions, 449 flow. Second operand 19 states and 499 transitions. [2024-10-24 19:13:22,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 775 flow [2024-10-24 19:13:22,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 144 transitions, 759 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-24 19:13:22,476 INFO L231 Difference]: Finished difference. Result has 154 places, 132 transitions, 555 flow [2024-10-24 19:13:22,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=555, PETRI_PLACES=154, PETRI_TRANSITIONS=132} [2024-10-24 19:13:22,477 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 36 predicate places. [2024-10-24 19:13:22,477 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 132 transitions, 555 flow [2024-10-24 19:13:22,477 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-10-24 19:13:22,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:22,477 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:13:22,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 19:13:22,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:22,682 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-10-24 19:13:22,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -453080842, now seen corresponding path program 1 times [2024-10-24 19:13:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:22,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604683712] [2024-10-24 19:13:22,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:13:22,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:22,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:22,684 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:22,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 19:13:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:13:23,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 19:13:23,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:23,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 19:13:23,127 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-10-24 19:13:23,191 INFO L349 Elim1Store]: treesize reduction 90, result has 31.3 percent of original size [2024-10-24 19:13:23,193 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-10-24 19:13:23,254 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-10-24 19:13:23,310 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-10-24 19:13:23,340 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-10-24 19:13:23,393 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-10-24 19:13:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:23,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:23,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:23,996 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-10-24 19:13:24,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:13:24,012 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-10-24 19:13:24,020 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-10-24 19:13:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:25,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:25,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604683712] [2024-10-24 19:13:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604683712] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:25,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:25,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 19:13:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329675237] [2024-10-24 19:13:25,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:25,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 19:13:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:25,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 19:13:25,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=177, Unknown=21, NotChecked=0, Total=240 [2024-10-24 19:13:27,508 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 133 [2024-10-24 19:13:27,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 132 transitions, 555 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-10-24 19:13:27,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:27,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 133 [2024-10-24 19:13:27,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:29,714 INFO L124 PetriNetUnfolderBase]: 329/1031 cut-off events. [2024-10-24 19:13:29,715 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2024-10-24 19:13:29,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1031 events. 329/1031 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6084 event pairs, 292 based on Foata normal form. 6/806 useless extension candidates. Maximal degree in co-relation 1984. Up to 679 conditions per place. [2024-10-24 19:13:29,719 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 80 selfloop transitions, 27 changer transitions 0/137 dead transitions. [2024-10-24 19:13:29,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 137 transitions, 785 flow [2024-10-24 19:13:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:13:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:13:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 416 transitions. [2024-10-24 19:13:29,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2843472317156528 [2024-10-24 19:13:29,722 INFO L175 Difference]: Start difference. First operand has 154 places, 132 transitions, 555 flow. Second operand 11 states and 416 transitions. [2024-10-24 19:13:29,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 137 transitions, 785 flow [2024-10-24 19:13:29,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 137 transitions, 709 flow, removed 18 selfloop flow, removed 11 redundant places. [2024-10-24 19:13:29,726 INFO L231 Difference]: Finished difference. Result has 154 places, 132 transitions, 538 flow [2024-10-24 19:13:29,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=538, PETRI_PLACES=154, PETRI_TRANSITIONS=132} [2024-10-24 19:13:29,727 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 36 predicate places. [2024-10-24 19:13:29,727 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 132 transitions, 538 flow [2024-10-24 19:13:29,727 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-10-24 19:13:29,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:29,728 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-10-24 19:13:29,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-24 19:13:29,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:29,928 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-24 19:13:29,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1720851500, now seen corresponding path program 2 times [2024-10-24 19:13:29,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:29,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123108822] [2024-10-24 19:13:29,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:13:29,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:29,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:29,930 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:29,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 19:13:30,429 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:13:30,429 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:13:30,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:13:30,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:30,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:30,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123108822] [2024-10-24 19:13:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123108822] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:30,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-24 19:13:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129247839] [2024-10-24 19:13:30,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 19:13:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 19:13:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:13:30,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-10-24 19:13:30,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 132 transitions, 538 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-10-24 19:13:30,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:30,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-10-24 19:13:30,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:31,464 INFO L124 PetriNetUnfolderBase]: 127/699 cut-off events. [2024-10-24 19:13:31,465 INFO L125 PetriNetUnfolderBase]: For 375/376 co-relation queries the response was YES. [2024-10-24 19:13:31,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 699 events. 127/699 cut-off events. For 375/376 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2987 event pairs, 105 based on Foata normal form. 12/609 useless extension candidates. Maximal degree in co-relation 1520. Up to 267 conditions per place. [2024-10-24 19:13:31,468 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 120 selfloop transitions, 24 changer transitions 0/208 dead transitions. [2024-10-24 19:13:31,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 208 transitions, 1450 flow [2024-10-24 19:13:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 19:13:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 19:13:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1008 transitions. [2024-10-24 19:13:31,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2024-10-24 19:13:31,471 INFO L175 Difference]: Start difference. First operand has 154 places, 132 transitions, 538 flow. Second operand 12 states and 1008 transitions. [2024-10-24 19:13:31,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 208 transitions, 1450 flow [2024-10-24 19:13:31,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 208 transitions, 1276 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-10-24 19:13:31,475 INFO L231 Difference]: Finished difference. Result has 163 places, 146 transitions, 744 flow [2024-10-24 19:13:31,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=145, 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=744, PETRI_PLACES=163, PETRI_TRANSITIONS=146} [2024-10-24 19:13:31,475 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 45 predicate places. [2024-10-24 19:13:31,476 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 146 transitions, 744 flow [2024-10-24 19:13:31,476 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-10-24 19:13:31,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:31,476 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-10-24 19:13:31,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-24 19:13:31,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:31,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-24 19:13:31,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash 414467412, now seen corresponding path program 3 times [2024-10-24 19:13:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:31,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051361669] [2024-10-24 19:13:31,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:13:31,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:31,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:31,680 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:31,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 19:13:43,225 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-24 19:13:43,225 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:13:43,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 19:13:43,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:13:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:43,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:13:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:13:43,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:13:43,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051361669] [2024-10-24 19:13:43,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051361669] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:13:43,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:13:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-24 19:13:43,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243573124] [2024-10-24 19:13:43,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:13:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 19:13:43,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:13:43,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 19:13:43,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-10-24 19:13:43,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-10-24 19:13:43,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 146 transitions, 744 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-10-24 19:13:43,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:13:43,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-10-24 19:13:43,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:13:46,272 INFO L124 PetriNetUnfolderBase]: 127/939 cut-off events. [2024-10-24 19:13:46,273 INFO L125 PetriNetUnfolderBase]: For 1591/1592 co-relation queries the response was YES. [2024-10-24 19:13:46,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 939 events. 127/939 cut-off events. For 1591/1592 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3013 event pairs, 105 based on Foata normal form. 24/861 useless extension candidates. Maximal degree in co-relation 2304. Up to 267 conditions per place. [2024-10-24 19:13:46,276 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 216 selfloop transitions, 48 changer transitions 0/328 dead transitions. [2024-10-24 19:13:46,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 328 transitions, 2664 flow [2024-10-24 19:13:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 19:13:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-24 19:13:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1986 transitions. [2024-10-24 19:13:46,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6221804511278195 [2024-10-24 19:13:46,280 INFO L175 Difference]: Start difference. First operand has 163 places, 146 transitions, 744 flow. Second operand 24 states and 1986 transitions. [2024-10-24 19:13:46,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 328 transitions, 2664 flow [2024-10-24 19:13:46,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 328 transitions, 2652 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:13:46,289 INFO L231 Difference]: Finished difference. Result has 196 places, 172 transitions, 1320 flow [2024-10-24 19:13:46,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1320, PETRI_PLACES=196, PETRI_TRANSITIONS=172} [2024-10-24 19:13:46,290 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 78 predicate places. [2024-10-24 19:13:46,290 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 172 transitions, 1320 flow [2024-10-24 19:13:46,291 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-10-24 19:13:46,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:13:46,291 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-10-24 19:13:46,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-24 19:13:46,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:46,495 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-10-24 19:13:46,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:13:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1820371028, now seen corresponding path program 4 times [2024-10-24 19:13:46,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:13:46,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301756021] [2024-10-24 19:13:46,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 19:13:46,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:13:46,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:13:46,499 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:13:46,501 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