./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.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 a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:40:03,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:40:03,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:40:03,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:40:03,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:40:03,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:40:03,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:40:03,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:40:03,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:40:03,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:40:03,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:40:03,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:40:03,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:40:03,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:40:03,606 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:40:03,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:40:03,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:40:03,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:40:03,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:40:03,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:40:03,607 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:40:03,608 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:40:03,609 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:40:03,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:40:03,609 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:40:03,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:40:03,609 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:40:03,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:40:03,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:40:03,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:40:03,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:40:03,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:40:03,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:40:03,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:40:03,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:40:03,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:40:03,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:40:03,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:40:03,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:40:03,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:40:03,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:40:03,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:40:03,613 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 -> a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df [2024-11-09 10:40:03,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:40:03,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:40:03,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:40:03,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:40:03,830 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:40:03,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2024-11-09 10:40:05,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:40:05,476 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:40:05,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2024-11-09 10:40:05,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58cf8ead0/40c37858f4664d9c8da63e3898e08624/FLAG40c061e86 [2024-11-09 10:40:05,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58cf8ead0/40c37858f4664d9c8da63e3898e08624 [2024-11-09 10:40:05,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:40:05,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:40:05,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:05,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:40:05,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:40:05,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:05" (1/1) ... [2024-11-09 10:40:05,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bea36fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:05, skipping insertion in model container [2024-11-09 10:40:05,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:05" (1/1) ... [2024-11-09 10:40:05,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:40:06,212 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:06,212 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:06,213 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:06,213 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:06,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:06,268 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 10:40:06,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78808abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:06, skipping insertion in model container [2024-11-09 10:40:06,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:06,270 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:40:06,271 INFO L158 Benchmark]: Toolchain (without parser) took 434.96ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 65.1MB in the beginning and 165.8MB in the end (delta: -100.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-09 10:40:06,272 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:40:06,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.24ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 64.7MB in the beginning and 165.8MB in the end (delta: -101.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-09 10:40:06,273 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.24ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 64.7MB in the beginning and 165.8MB in the end (delta: -101.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1038]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.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 a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:40:08,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:40:08,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:40:08,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:40:08,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:40:08,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:40:08,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:40:08,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:40:08,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:40:08,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:40:08,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:40:08,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:40:08,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:40:08,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:40:08,310 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:40:08,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:40:08,312 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:40:08,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:40:08,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:40:08,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:40:08,313 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:40:08,316 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:40:08,317 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:40:08,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:40:08,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:40:08,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:40:08,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:40:08,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:40:08,317 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:40:08,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:40:08,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:40:08,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:40:08,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:40:08,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:40:08,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:40:08,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:40:08,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:40:08,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:40:08,319 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:40:08,319 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:40:08,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:40:08,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:40:08,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:40:08,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:40:08,321 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 -> a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df [2024-11-09 10:40:08,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:40:08,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:40:08,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:40:08,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:40:08,611 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:40:08,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2024-11-09 10:40:10,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:40:10,283 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:40:10,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2024-11-09 10:40:10,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92149cb9b/ea8b7280348741499b9494a1be125bd9/FLAG0781ad77f [2024-11-09 10:40:10,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92149cb9b/ea8b7280348741499b9494a1be125bd9 [2024-11-09 10:40:10,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:40:10,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:40:10,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:10,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:40:10,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:40:10,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:10,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c9c3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10, skipping insertion in model container [2024-11-09 10:40:10,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:10,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:40:10,713 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,714 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,714 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,715 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:10,780 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:40:10,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:40:10,834 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,834 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,834 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,835 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:10,864 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:40:10,894 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,895 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,895 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,895 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:10,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:10,963 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:40:10,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10 WrapperNode [2024-11-09 10:40:10,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:10,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:40:10,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:40:10,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:40:10,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:10,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,027 INFO L138 Inliner]: procedures = 275, calls = 98, calls flagged for inlining = 9, calls inlined = 8, statements flattened = 191 [2024-11-09 10:40:11,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:40:11,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:40:11,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:40:11,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:40:11,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,062 INFO L175 MemorySlicer]: Split 84 memory accesses to 1 slices as follows [84]. 100 percent of accesses are in the largest equivalence class. The 70 initializations are split as follows [70]. The 10 writes are split as follows [10]. [2024-11-09 10:40:11,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:40:11,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:40:11,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:40:11,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:40:11,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (1/1) ... [2024-11-09 10:40:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:40:11,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:40:11,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:40:11,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:40:11,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:40:11,178 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 10:40:11,178 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 10:40:11,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:40:11,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:40:11,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:40:11,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:40:11,179 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:40:11,179 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:40:11,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:40:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:40:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:40:11,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:40:11,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:40:11,184 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:40:11,293 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:40:11,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:40:11,792 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:40:11,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:40:12,822 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:40:12,823 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 10:40:12,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:12 BoogieIcfgContainer [2024-11-09 10:40:12,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:40:12,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:40:12,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:40:12,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:40:12,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:40:10" (1/3) ... [2024-11-09 10:40:12,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dc18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:40:12, skipping insertion in model container [2024-11-09 10:40:12,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:10" (2/3) ... [2024-11-09 10:40:12,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dc18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:40:12, skipping insertion in model container [2024-11-09 10:40:12,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:12" (3/3) ... [2024-11-09 10:40:12,831 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_22-nocollapse.i [2024-11-09 10:40:12,844 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:40:12,844 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-09 10:40:12,844 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:40:12,911 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:40:12,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 178 flow [2024-11-09 10:40:12,982 INFO L124 PetriNetUnfolderBase]: 6/83 cut-off events. [2024-11-09 10:40:12,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:40:12,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 6/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 315 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-11-09 10:40:12,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 178 flow [2024-11-09 10:40:12,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 172 flow [2024-11-09 10:40:13,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:40:13,006 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;@264b58a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:40:13,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-11-09 10:40:13,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:40:13,014 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:40:13,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:40:13,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:13,015 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:40:13,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:13,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash 535531, now seen corresponding path program 1 times [2024-11-09 10:40:13,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:13,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865694250] [2024-11-09 10:40:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:13,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:13,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:13,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:13,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:40:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:13,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:40:13,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:13,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:13,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:13,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865694250] [2024-11-09 10:40:13,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865694250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:13,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:13,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653055707] [2024-11-09 10:40:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:13,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:13,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 85 [2024-11-09 10:40:13,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:13,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:13,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 85 [2024-11-09 10:40:13,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:13,752 INFO L124 PetriNetUnfolderBase]: 482/968 cut-off events. [2024-11-09 10:40:13,756 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:40:13,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 968 events. 482/968 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5276 event pairs, 368 based on Foata normal form. 1/867 useless extension candidates. Maximal degree in co-relation 1692. Up to 752 conditions per place. [2024-11-09 10:40:13,768 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 34 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2024-11-09 10:40:13,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 238 flow [2024-11-09 10:40:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2024-11-09 10:40:13,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.638235294117647 [2024-11-09 10:40:13,797 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 172 flow. Second operand 4 states and 217 transitions. [2024-11-09 10:40:13,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 238 flow [2024-11-09 10:40:13,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:13,809 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 168 flow [2024-11-09 10:40:13,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2024-11-09 10:40:13,818 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2024-11-09 10:40:13,818 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 168 flow [2024-11-09 10:40:13,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:13,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:13,822 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:40:13,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:40:14,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:14,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:14,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 535532, now seen corresponding path program 1 times [2024-11-09 10:40:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240165147] [2024-11-09 10:40:14,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:14,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:14,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:14,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:14,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:40:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:14,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:40:14,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:14,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:14,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:14,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240165147] [2024-11-09 10:40:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240165147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:14,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:14,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563785309] [2024-11-09 10:40:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:14,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:14,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:14,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:14,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 85 [2024-11-09 10:40:14,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:14,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:14,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 85 [2024-11-09 10:40:14,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:14,900 INFO L124 PetriNetUnfolderBase]: 483/973 cut-off events. [2024-11-09 10:40:14,900 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:40:14,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 973 events. 483/973 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5211 event pairs, 368 based on Foata normal form. 3/875 useless extension candidates. Maximal degree in co-relation 1732. Up to 757 conditions per place. [2024-11-09 10:40:14,906 INFO L140 encePairwiseOnDemand]: 77/85 looper letters, 38 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2024-11-09 10:40:14,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 266 flow [2024-11-09 10:40:14,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2024-11-09 10:40:14,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-11-09 10:40:14,909 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 168 flow. Second operand 4 states and 230 transitions. [2024-11-09 10:40:14,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 266 flow [2024-11-09 10:40:14,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:40:14,912 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 201 flow [2024-11-09 10:40:14,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2024-11-09 10:40:14,913 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:40:14,913 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 201 flow [2024-11-09 10:40:14,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:14,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:14,914 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:40:14,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:15,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:15,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:15,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1225385904, now seen corresponding path program 1 times [2024-11-09 10:40:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945130355] [2024-11-09 10:40:15,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:15,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:15,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:40:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:15,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:40:15,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:15,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:40:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:15,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:15,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:15,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945130355] [2024-11-09 10:40:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945130355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390039254] [2024-11-09 10:40:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:15,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:15,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:15,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 85 [2024-11-09 10:40:15,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:15,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:15,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 85 [2024-11-09 10:40:15,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:15,568 INFO L124 PetriNetUnfolderBase]: 483/972 cut-off events. [2024-11-09 10:40:15,569 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:40:15,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 972 events. 483/972 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5207 event pairs, 368 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 1738. Up to 753 conditions per place. [2024-11-09 10:40:15,574 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 36 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2024-11-09 10:40:15,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 277 flow [2024-11-09 10:40:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-11-09 10:40:15,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7176470588235294 [2024-11-09 10:40:15,576 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 201 flow. Second operand 3 states and 183 transitions. [2024-11-09 10:40:15,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 277 flow [2024-11-09 10:40:15,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:15,578 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 202 flow [2024-11-09 10:40:15,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-11-09 10:40:15,578 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:40:15,579 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 202 flow [2024-11-09 10:40:15,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:15,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:15,579 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:40:15,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:15,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:15,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:15,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1225385905, now seen corresponding path program 1 times [2024-11-09 10:40:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628670324] [2024-11-09 10:40:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:15,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:15,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:15,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:40:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:15,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:40:15,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:15,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:40:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:15,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:15,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:15,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628670324] [2024-11-09 10:40:15,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628670324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:15,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:15,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078236175] [2024-11-09 10:40:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:15,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:15,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:15,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 85 [2024-11-09 10:40:15,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:15,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:15,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 85 [2024-11-09 10:40:15,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:16,165 INFO L124 PetriNetUnfolderBase]: 483/971 cut-off events. [2024-11-09 10:40:16,165 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 10:40:16,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 971 events. 483/971 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5202 event pairs, 368 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 1737. Up to 753 conditions per place. [2024-11-09 10:40:16,170 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 36 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-11-09 10:40:16,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 278 flow [2024-11-09 10:40:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-11-09 10:40:16,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7176470588235294 [2024-11-09 10:40:16,173 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 202 flow. Second operand 3 states and 183 transitions. [2024-11-09 10:40:16,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 278 flow [2024-11-09 10:40:16,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:16,175 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 200 flow [2024-11-09 10:40:16,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2024-11-09 10:40:16,175 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -2 predicate places. [2024-11-09 10:40:16,176 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 200 flow [2024-11-09 10:40:16,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:16,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:16,176 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:40:16,182 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:16,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:16,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:16,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 667743887, now seen corresponding path program 1 times [2024-11-09 10:40:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090489724] [2024-11-09 10:40:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:16,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:16,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:16,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:16,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:40:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:16,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:40:16,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:16,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:16,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090489724] [2024-11-09 10:40:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090489724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11697575] [2024-11-09 10:40:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:16,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:16,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-09 10:40:16,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:16,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:16,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-09 10:40:16,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:16,745 INFO L124 PetriNetUnfolderBase]: 482/993 cut-off events. [2024-11-09 10:40:16,746 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:40:16,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 993 events. 482/993 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5229 event pairs, 368 based on Foata normal form. 2/884 useless extension candidates. Maximal degree in co-relation 1768. Up to 753 conditions per place. [2024-11-09 10:40:16,751 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 40 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2024-11-09 10:40:16,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 85 transitions, 298 flow [2024-11-09 10:40:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-11-09 10:40:16,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7490196078431373 [2024-11-09 10:40:16,756 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 200 flow. Second operand 3 states and 191 transitions. [2024-11-09 10:40:16,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 85 transitions, 298 flow [2024-11-09 10:40:16,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:16,758 INFO L231 Difference]: Finished difference. Result has 83 places, 81 transitions, 205 flow [2024-11-09 10:40:16,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=83, PETRI_TRANSITIONS=81} [2024-11-09 10:40:16,759 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:40:16,759 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 81 transitions, 205 flow [2024-11-09 10:40:16,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:16,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:16,760 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:16,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:16,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:16,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:16,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash 667743151, now seen corresponding path program 1 times [2024-11-09 10:40:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:16,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144962534] [2024-11-09 10:40:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:16,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:16,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:16,968 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:16,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:40:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:17,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:40:17,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:17,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:40:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:17,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:17,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:17,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144962534] [2024-11-09 10:40:17,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144962534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:17,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:17,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566337127] [2024-11-09 10:40:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:17,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:17,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 85 [2024-11-09 10:40:17,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 81 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:17,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:17,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 85 [2024-11-09 10:40:17,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:17,512 INFO L124 PetriNetUnfolderBase]: 482/989 cut-off events. [2024-11-09 10:40:17,512 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 10:40:17,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 989 events. 482/989 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5206 event pairs, 368 based on Foata normal form. 2/884 useless extension candidates. Maximal degree in co-relation 1764. Up to 757 conditions per place. [2024-11-09 10:40:17,528 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 37 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-09 10:40:17,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 283 flow [2024-11-09 10:40:17,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-11-09 10:40:17,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6441176470588236 [2024-11-09 10:40:17,530 INFO L175 Difference]: Start difference. First operand has 83 places, 81 transitions, 205 flow. Second operand 4 states and 219 transitions. [2024-11-09 10:40:17,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 283 flow [2024-11-09 10:40:17,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:17,532 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 206 flow [2024-11-09 10:40:17,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2024-11-09 10:40:17,537 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:40:17,537 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 206 flow [2024-11-09 10:40:17,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:17,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:17,541 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:17,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:40:17,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:17,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:17,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 667743150, now seen corresponding path program 1 times [2024-11-09 10:40:17,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:17,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838688897] [2024-11-09 10:40:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:17,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:17,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:17,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:17,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:40:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:17,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:40:17,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:17,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 7 [2024-11-09 10:40:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:17,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:17,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838688897] [2024-11-09 10:40:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838688897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:17,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:17,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:17,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194653894] [2024-11-09 10:40:17,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:17,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:17,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:17,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:18,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 85 [2024-11-09 10:40:18,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:18,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:18,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 85 [2024-11-09 10:40:18,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:18,263 INFO L124 PetriNetUnfolderBase]: 482/985 cut-off events. [2024-11-09 10:40:18,263 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:40:18,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 985 events. 482/985 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5174 event pairs, 368 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 1768. Up to 755 conditions per place. [2024-11-09 10:40:18,268 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 34 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2024-11-09 10:40:18,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 284 flow [2024-11-09 10:40:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:40:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:40:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2024-11-09 10:40:18,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5976470588235294 [2024-11-09 10:40:18,269 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 206 flow. Second operand 5 states and 254 transitions. [2024-11-09 10:40:18,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 284 flow [2024-11-09 10:40:18,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:40:18,271 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 208 flow [2024-11-09 10:40:18,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2024-11-09 10:40:18,272 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -2 predicate places. [2024-11-09 10:40:18,272 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 208 flow [2024-11-09 10:40:18,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:18,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:18,272 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:18,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:40:18,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:18,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:18,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:18,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1751054642, now seen corresponding path program 1 times [2024-11-09 10:40:18,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:18,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191208429] [2024-11-09 10:40:18,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:18,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:18,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:18,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:18,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:40:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:18,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:40:18,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:18,933 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:40:18,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 10:40:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:18,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:18,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:18,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191208429] [2024-11-09 10:40:18,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191208429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:18,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:18,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:18,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712120489] [2024-11-09 10:40:18,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:18,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:40:18,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:18,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:40:18,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:40:19,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 85 [2024-11-09 10:40:19,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:19,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:19,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 85 [2024-11-09 10:40:19,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:19,342 INFO L124 PetriNetUnfolderBase]: 482/981 cut-off events. [2024-11-09 10:40:19,342 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 10:40:19,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 981 events. 482/981 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5162 event pairs, 368 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 1762. Up to 750 conditions per place. [2024-11-09 10:40:19,346 INFO L140 encePairwiseOnDemand]: 79/85 looper letters, 33 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2024-11-09 10:40:19,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 282 flow [2024-11-09 10:40:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:40:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:40:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2024-11-09 10:40:19,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6164705882352941 [2024-11-09 10:40:19,348 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 208 flow. Second operand 5 states and 262 transitions. [2024-11-09 10:40:19,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 282 flow [2024-11-09 10:40:19,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 268 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:40:19,351 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 202 flow [2024-11-09 10:40:19,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2024-11-09 10:40:19,352 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2024-11-09 10:40:19,352 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 202 flow [2024-11-09 10:40:19,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:19,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:19,352 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:19,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 10:40:19,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:19,553 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:19,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1751054643, now seen corresponding path program 1 times [2024-11-09 10:40:19,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:19,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424363269] [2024-11-09 10:40:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:19,558 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:19,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:40:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:19,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:40:19,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:20,061 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 10:40:20,061 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 13 [2024-11-09 10:40:20,076 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:40:20,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:40:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:20,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:20,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:20,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424363269] [2024-11-09 10:40:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424363269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:40:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319120696] [2024-11-09 10:40:20,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:20,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:40:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:40:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:40:20,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 85 [2024-11-09 10:40:20,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:20,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:20,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 85 [2024-11-09 10:40:20,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:20,924 INFO L124 PetriNetUnfolderBase]: 483/1011 cut-off events. [2024-11-09 10:40:20,924 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-09 10:40:20,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1011 events. 483/1011 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5522 event pairs, 368 based on Foata normal form. 2/898 useless extension candidates. Maximal degree in co-relation 1757. Up to 761 conditions per place. [2024-11-09 10:40:20,928 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 41 selfloop transitions, 7 changer transitions 0/82 dead transitions. [2024-11-09 10:40:20,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 330 flow [2024-11-09 10:40:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:40:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:40:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 272 transitions. [2024-11-09 10:40:20,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-11-09 10:40:20,930 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 202 flow. Second operand 5 states and 272 transitions. [2024-11-09 10:40:20,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 330 flow [2024-11-09 10:40:20,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:40:20,932 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 250 flow [2024-11-09 10:40:20,932 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2024-11-09 10:40:20,933 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:40:20,933 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 250 flow [2024-11-09 10:40:20,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:20,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:20,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:20,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:21,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:21,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:21,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1551880348, now seen corresponding path program 1 times [2024-11-09 10:40:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118834831] [2024-11-09 10:40:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:21,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:21,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:21,142 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:21,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 10:40:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:21,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:40:21,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:40:21,882 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 28 treesize of output 27 [2024-11-09 10:40:21,941 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:40:21,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:40:21,988 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 32 treesize of output 25 [2024-11-09 10:40:22,036 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 32 treesize of output 25 [2024-11-09 10:40:22,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-09 10:40:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:22,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:22,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:22,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118834831] [2024-11-09 10:40:22,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118834831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:22,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:22,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:40:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931658028] [2024-11-09 10:40:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:22,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:40:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:40:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:40:22,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 85 [2024-11-09 10:40:22,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:22,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:22,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 85 [2024-11-09 10:40:22,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:23,444 INFO L124 PetriNetUnfolderBase]: 483/1009 cut-off events. [2024-11-09 10:40:23,444 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 10:40:23,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 1009 events. 483/1009 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5488 event pairs, 368 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1783. Up to 767 conditions per place. [2024-11-09 10:40:23,451 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 44 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2024-11-09 10:40:23,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 89 transitions, 396 flow [2024-11-09 10:40:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:40:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:40:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 458 transitions. [2024-11-09 10:40:23,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4898395721925134 [2024-11-09 10:40:23,453 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 250 flow. Second operand 11 states and 458 transitions. [2024-11-09 10:40:23,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 89 transitions, 396 flow [2024-11-09 10:40:23,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 89 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:23,458 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 329 flow [2024-11-09 10:40:23,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=329, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2024-11-09 10:40:23,458 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 13 predicate places. [2024-11-09 10:40:23,458 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 329 flow [2024-11-09 10:40:23,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:23,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:23,459 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:23,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:23,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:23,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:23,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:23,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1551880347, now seen corresponding path program 1 times [2024-11-09 10:40:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926366253] [2024-11-09 10:40:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:23,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:23,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:23,667 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:23,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 10:40:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:24,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:40:24,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:24,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:40:24,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:40:24,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 19 treesize of output 18 [2024-11-09 10:40:24,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 10:40:24,395 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:40:24,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:40:24,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:40:24,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 10:40:24,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 10:40:24,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 10:40:24,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 10:40:24,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 10:40:24,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 10:40:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:24,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:24,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:24,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926366253] [2024-11-09 10:40:24,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926366253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:24,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:24,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:40:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349918642] [2024-11-09 10:40:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:24,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:40:24,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:24,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:40:24,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:40:25,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 85 [2024-11-09 10:40:25,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 329 flow. Second operand has 10 states, 10 states have (on average 32.0) internal successors, (320), 10 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:25,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:25,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 85 [2024-11-09 10:40:25,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:26,259 INFO L124 PetriNetUnfolderBase]: 483/1008 cut-off events. [2024-11-09 10:40:26,262 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-09 10:40:26,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 1008 events. 483/1008 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5477 event pairs, 368 based on Foata normal form. 1/913 useless extension candidates. Maximal degree in co-relation 1790. Up to 774 conditions per place. [2024-11-09 10:40:26,286 INFO L140 encePairwiseOnDemand]: 73/85 looper letters, 63 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2024-11-09 10:40:26,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 524 flow [2024-11-09 10:40:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:40:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:40:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 410 transitions. [2024-11-09 10:40:26,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4385026737967914 [2024-11-09 10:40:26,292 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 329 flow. Second operand 11 states and 410 transitions. [2024-11-09 10:40:26,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 524 flow [2024-11-09 10:40:26,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 100 transitions, 506 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 10:40:26,300 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 372 flow [2024-11-09 10:40:26,301 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=372, PETRI_PLACES=106, PETRI_TRANSITIONS=90} [2024-11-09 10:40:26,301 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 22 predicate places. [2024-11-09 10:40:26,301 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 372 flow [2024-11-09 10:40:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.0) internal successors, (320), 10 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:26,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:26,302 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:26,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:26,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:26,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:26,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash -863650033, now seen corresponding path program 1 times [2024-11-09 10:40:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604535662] [2024-11-09 10:40:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:26,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:26,506 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:26,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 10:40:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:26,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:40:26,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:26,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:40:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:26,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:26,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:26,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604535662] [2024-11-09 10:40:26,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604535662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:26,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:26,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:26,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406367311] [2024-11-09 10:40:26,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:26,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:26,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:26,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:26,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:26,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 85 [2024-11-09 10:40:26,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:26,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:26,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 85 [2024-11-09 10:40:26,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:26,988 INFO L124 PetriNetUnfolderBase]: 483/1000 cut-off events. [2024-11-09 10:40:26,988 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-09 10:40:26,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1000 events. 483/1000 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5421 event pairs, 368 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1795. Up to 754 conditions per place. [2024-11-09 10:40:26,993 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 41 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2024-11-09 10:40:26,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 88 transitions, 474 flow [2024-11-09 10:40:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-11-09 10:40:26,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6441176470588236 [2024-11-09 10:40:26,996 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 372 flow. Second operand 4 states and 219 transitions. [2024-11-09 10:40:26,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 88 transitions, 474 flow [2024-11-09 10:40:26,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 88 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:26,998 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 388 flow [2024-11-09 10:40:26,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2024-11-09 10:40:26,999 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 21 predicate places. [2024-11-09 10:40:26,999 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 388 flow [2024-11-09 10:40:27,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:27,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:27,000 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:27,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 10:40:27,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:27,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:27,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash -863650032, now seen corresponding path program 1 times [2024-11-09 10:40:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:27,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723363552] [2024-11-09 10:40:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:27,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-11-09 10:40:27,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:27,203 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:27,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 10:40:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:27,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:40:27,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:27,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:40:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:27,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:27,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723363552] [2024-11-09 10:40:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723363552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193083669] [2024-11-09 10:40:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:27,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:27,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:27,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 85 [2024-11-09 10:40:27,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:27,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:27,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 85 [2024-11-09 10:40:27,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:27,695 INFO L124 PetriNetUnfolderBase]: 483/992 cut-off events. [2024-11-09 10:40:27,695 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-09 10:40:27,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 992 events. 483/992 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5356 event pairs, 368 based on Foata normal form. 8/909 useless extension candidates. Maximal degree in co-relation 1792. Up to 754 conditions per place. [2024-11-09 10:40:27,700 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 39 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-11-09 10:40:27,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 86 transitions, 486 flow [2024-11-09 10:40:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2024-11-09 10:40:27,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-11-09 10:40:27,702 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 388 flow. Second operand 4 states and 225 transitions. [2024-11-09 10:40:27,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 86 transitions, 486 flow [2024-11-09 10:40:27,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 86 transitions, 462 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:40:27,704 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 384 flow [2024-11-09 10:40:27,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2024-11-09 10:40:27,705 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 19 predicate places. [2024-11-09 10:40:27,705 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 384 flow [2024-11-09 10:40:27,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:27,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:27,705 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:27,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 10:40:27,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:27,906 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:27,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1632836903, now seen corresponding path program 1 times [2024-11-09 10:40:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:27,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590479083] [2024-11-09 10:40:27,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:27,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:27,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:27,910 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:27,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:40:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:28,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:40:28,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:28,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:28,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:28,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590479083] [2024-11-09 10:40:28,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590479083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:28,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:28,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:40:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414699448] [2024-11-09 10:40:28,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:28,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:40:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:28,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:40:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:40:28,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-09 10:40:28,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:28,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:28,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-09 10:40:28,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:28,421 INFO L124 PetriNetUnfolderBase]: 483/1042 cut-off events. [2024-11-09 10:40:28,444 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-11-09 10:40:28,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 1042 events. 483/1042 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5366 event pairs, 368 based on Foata normal form. 6/953 useless extension candidates. Maximal degree in co-relation 1864. Up to 750 conditions per place. [2024-11-09 10:40:28,450 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 57 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2024-11-09 10:40:28,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 670 flow [2024-11-09 10:40:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:40:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:40:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 354 transitions. [2024-11-09 10:40:28,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-11-09 10:40:28,455 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 384 flow. Second operand 6 states and 354 transitions. [2024-11-09 10:40:28,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 670 flow [2024-11-09 10:40:28,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 104 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:40:28,458 INFO L231 Difference]: Finished difference. Result has 109 places, 92 transitions, 464 flow [2024-11-09 10:40:28,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=109, PETRI_TRANSITIONS=92} [2024-11-09 10:40:28,460 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 25 predicate places. [2024-11-09 10:40:28,460 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 464 flow [2024-11-09 10:40:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:28,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:28,461 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:28,467 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 (15)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:28,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:28,661 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:28,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:28,662 INFO L85 PathProgramCache]: Analyzing trace with hash -976920115, now seen corresponding path program 1 times [2024-11-09 10:40:28,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:28,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911834858] [2024-11-09 10:40:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:28,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:28,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:28,664 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:28,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 10:40:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:29,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 10:40:29,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:29,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:40:29,444 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 23 treesize of output 1 [2024-11-09 10:40:29,450 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 11 [2024-11-09 10:40:29,497 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-09 10:40:29,497 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 20 treesize of output 22 [2024-11-09 10:40:29,527 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:40:29,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:40:29,575 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 20 treesize of output 15 [2024-11-09 10:40:29,584 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 22 treesize of output 17 [2024-11-09 10:40:29,638 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 22 treesize of output 17 [2024-11-09 10:40:29,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 10:40:29,669 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-11-09 10:40:29,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 10:40:29,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 10:40:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:29,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:29,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_576) |c_~#c~0.base|) .cse1)))))) is different from false [2024-11-09 10:40:29,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_576) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_577) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-09 10:40:30,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:30,139 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 108 treesize of output 109 [2024-11-09 10:40:30,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:30,149 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 100 treesize of output 85 [2024-11-09 10:40:30,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:30,169 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 118 treesize of output 121 [2024-11-09 10:40:30,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:30,194 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 184 treesize of output 163 [2024-11-09 10:40:30,207 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 91 treesize of output 85 [2024-11-09 10:40:30,215 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 85 treesize of output 79 [2024-11-09 10:40:30,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:30,256 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 88 treesize of output 112 [2024-11-09 10:40:30,272 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 75 treesize of output 63 [2024-11-09 10:40:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 10:40:31,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:31,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911834858] [2024-11-09 10:40:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911834858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:31,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-09 10:40:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933564181] [2024-11-09 10:40:31,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:31,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:40:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:31,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:40:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=5, NotChecked=54, Total=272 [2024-11-09 10:40:31,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2024-11-09 10:40:31,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 464 flow. Second operand has 17 states, 17 states have (on average 8.235294117647058) internal successors, (140), 17 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:31,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:31,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2024-11-09 10:40:31,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:33,723 INFO L124 PetriNetUnfolderBase]: 2199/3503 cut-off events. [2024-11-09 10:40:33,723 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-09 10:40:33,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7237 conditions, 3503 events. 2199/3503 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18308 event pairs, 1920 based on Foata normal form. 6/2095 useless extension candidates. Maximal degree in co-relation 7010. Up to 3398 conditions per place. [2024-11-09 10:40:33,739 INFO L140 encePairwiseOnDemand]: 75/85 looper letters, 67 selfloop transitions, 26 changer transitions 0/97 dead transitions. [2024-11-09 10:40:33,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 97 transitions, 664 flow [2024-11-09 10:40:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:40:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:40:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2024-11-09 10:40:33,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.14411764705882352 [2024-11-09 10:40:33,742 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 464 flow. Second operand 12 states and 147 transitions. [2024-11-09 10:40:33,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 97 transitions, 664 flow [2024-11-09 10:40:33,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 97 transitions, 646 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:33,745 INFO L231 Difference]: Finished difference. Result has 120 places, 93 transitions, 506 flow [2024-11-09 10:40:33,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=506, PETRI_PLACES=120, PETRI_TRANSITIONS=93} [2024-11-09 10:40:33,745 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 36 predicate places. [2024-11-09 10:40:33,745 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 93 transitions, 506 flow [2024-11-09 10:40:33,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.235294117647058) internal successors, (140), 17 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:33,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:33,746 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:33,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:33,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:33,947 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:33,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash -976920116, now seen corresponding path program 1 times [2024-11-09 10:40:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:33,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321173736] [2024-11-09 10:40:33,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:33,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:33,950 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:33,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 10:40:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:34,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 10:40:34,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:34,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:40:34,661 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 23 treesize of output 1 [2024-11-09 10:40:34,728 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-11-09 10:40:34,729 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 34 treesize of output 59 [2024-11-09 10:40:34,780 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 36 treesize of output 29 [2024-11-09 10:40:34,822 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 36 treesize of output 29 [2024-11-09 10:40:34,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-11-09 10:40:34,887 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 27 treesize of output 15 [2024-11-09 10:40:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:34,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:35,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_679) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-11-09 10:40:35,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:35,104 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 29 treesize of output 30 [2024-11-09 10:40:35,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:35,116 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 52 treesize of output 55 [2024-11-09 10:40:35,123 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 20 treesize of output 14 [2024-11-09 10:40:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 10:40:35,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:35,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321173736] [2024-11-09 10:40:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321173736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:35,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:35,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-09 10:40:35,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013416094] [2024-11-09 10:40:35,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:35,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:40:35,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:35,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:40:35,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=186, Unknown=10, NotChecked=28, Total=272 [2024-11-09 10:40:36,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 85 [2024-11-09 10:40:36,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 93 transitions, 506 flow. Second operand has 17 states, 17 states have (on average 14.235294117647058) internal successors, (242), 17 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:36,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:36,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 85 [2024-11-09 10:40:36,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:38,472 INFO L124 PetriNetUnfolderBase]: 1518/2676 cut-off events. [2024-11-09 10:40:38,472 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-11-09 10:40:38,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5384 conditions, 2676 events. 1518/2676 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15227 event pairs, 1287 based on Foata normal form. 0/1895 useless extension candidates. Maximal degree in co-relation 5139. Up to 2339 conditions per place. [2024-11-09 10:40:38,484 INFO L140 encePairwiseOnDemand]: 76/85 looper letters, 60 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2024-11-09 10:40:38,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 96 transitions, 686 flow [2024-11-09 10:40:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:40:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:40:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 212 transitions. [2024-11-09 10:40:38,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.20784313725490197 [2024-11-09 10:40:38,486 INFO L175 Difference]: Start difference. First operand has 120 places, 93 transitions, 506 flow. Second operand 12 states and 212 transitions. [2024-11-09 10:40:38,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 96 transitions, 686 flow [2024-11-09 10:40:38,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 96 transitions, 595 flow, removed 13 selfloop flow, removed 12 redundant places. [2024-11-09 10:40:38,489 INFO L231 Difference]: Finished difference. Result has 118 places, 92 transitions, 463 flow [2024-11-09 10:40:38,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=463, PETRI_PLACES=118, PETRI_TRANSITIONS=92} [2024-11-09 10:40:38,490 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 34 predicate places. [2024-11-09 10:40:38,490 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 92 transitions, 463 flow [2024-11-09 10:40:38,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.235294117647058) internal successors, (242), 17 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:38,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:38,490 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-11-09 10:40:38,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 10:40:38,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:38,695 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:38,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash 43256975, now seen corresponding path program 2 times [2024-11-09 10:40:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920830891] [2024-11-09 10:40:38,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:40:38,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:38,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:38,699 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:38,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 10:40:39,325 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:40:39,326 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:40:39,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:40:39,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:39,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:39,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920830891] [2024-11-09 10:40:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920830891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:39,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:40:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107734338] [2024-11-09 10:40:39,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:39,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:40:39,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:39,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:40:39,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:40:39,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-09 10:40:39,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 92 transitions, 463 flow. Second operand has 12 states, 12 states have (on average 53.916666666666664) internal successors, (647), 12 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:39,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:39,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-09 10:40:39,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:40,519 INFO L124 PetriNetUnfolderBase]: 483/1150 cut-off events. [2024-11-09 10:40:40,520 INFO L125 PetriNetUnfolderBase]: For 495/495 co-relation queries the response was YES. [2024-11-09 10:40:40,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 1150 events. 483/1150 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5326 event pairs, 368 based on Foata normal form. 12/1073 useless extension candidates. Maximal degree in co-relation 2086. Up to 750 conditions per place. [2024-11-09 10:40:40,527 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 93 selfloop transitions, 24 changer transitions 0/152 dead transitions. [2024-11-09 10:40:40,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 152 transitions, 1249 flow [2024-11-09 10:40:40,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:40:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:40:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 687 transitions. [2024-11-09 10:40:40,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6735294117647059 [2024-11-09 10:40:40,533 INFO L175 Difference]: Start difference. First operand has 118 places, 92 transitions, 463 flow. Second operand 12 states and 687 transitions. [2024-11-09 10:40:40,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 152 transitions, 1249 flow [2024-11-09 10:40:40,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 152 transitions, 1081 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-11-09 10:40:40,537 INFO L231 Difference]: Finished difference. Result has 125 places, 106 transitions, 653 flow [2024-11-09 10:40:40,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=653, PETRI_PLACES=125, PETRI_TRANSITIONS=106} [2024-11-09 10:40:40,541 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 41 predicate places. [2024-11-09 10:40:40,541 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 106 transitions, 653 flow [2024-11-09 10:40:40,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 53.916666666666664) internal successors, (647), 12 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:40,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:40,542 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-11-09 10:40:40,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 10:40:40,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:40,743 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:40,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1262161295, now seen corresponding path program 3 times [2024-11-09 10:40:40,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:40,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110184137] [2024-11-09 10:40:40,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:40:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:40,746 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:40:40,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 10:41:01,034 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-09 10:41:01,034 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:41:01,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:41:01,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:01,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:01,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:41:01,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110184137] [2024-11-09 10:41:01,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110184137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:01,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:41:01,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-09 10:41:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952464271] [2024-11-09 10:41:01,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:41:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:41:01,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:41:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:41:01,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-09 10:41:01,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 106 transitions, 653 flow. Second operand has 24 states, 24 states have (on average 54.458333333333336) internal successors, (1307), 24 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:01,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:01,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-09 10:41:01,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:04,155 INFO L124 PetriNetUnfolderBase]: 483/1390 cut-off events. [2024-11-09 10:41:04,155 INFO L125 PetriNetUnfolderBase]: For 1736/1736 co-relation queries the response was YES. [2024-11-09 10:41:04,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 1390 events. 483/1390 cut-off events. For 1736/1736 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5374 event pairs, 368 based on Foata normal form. 24/1325 useless extension candidates. Maximal degree in co-relation 2465. Up to 750 conditions per place. [2024-11-09 10:41:04,162 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 165 selfloop transitions, 48 changer transitions 0/248 dead transitions. [2024-11-09 10:41:04,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 248 transitions, 2325 flow [2024-11-09 10:41:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 10:41:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-09 10:41:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1353 transitions. [2024-11-09 10:41:04,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.663235294117647 [2024-11-09 10:41:04,167 INFO L175 Difference]: Start difference. First operand has 125 places, 106 transitions, 653 flow. Second operand 24 states and 1353 transitions. [2024-11-09 10:41:04,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 248 transitions, 2325 flow [2024-11-09 10:41:04,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 248 transitions, 2313 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:41:04,174 INFO L231 Difference]: Finished difference. Result has 158 places, 132 transitions, 1207 flow [2024-11-09 10:41:04,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1207, PETRI_PLACES=158, PETRI_TRANSITIONS=132} [2024-11-09 10:41:04,175 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 74 predicate places. [2024-11-09 10:41:04,175 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 132 transitions, 1207 flow [2024-11-09 10:41:04,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 54.458333333333336) internal successors, (1307), 24 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:04,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:04,176 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-11-09 10:41:04,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-09 10:41:04,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:41:04,380 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:41:04,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 56151951, now seen corresponding path program 4 times [2024-11-09 10:41:04,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:41:04,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737009672] [2024-11-09 10:41:04,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:41:04,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:41:04,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:41:04,384 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:41:04,385 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