./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.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_21-arrayloop2_nr.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 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:40:00,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:40:00,404 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:00,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:40:00,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:40:00,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:40:00,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:40:00,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:40:00,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:40:00,436 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:40:00,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:40:00,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:40:00,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:40:00,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:40:00,437 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:40:00,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:40:00,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:40:00,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:40:00,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:40:00,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:40:00,443 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:40:00,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:40:00,447 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:40:00,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:40:00,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:40:00,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:40:00,452 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:40:00,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:40:00,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:40:00,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:40:00,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:40:00,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:40:00,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:40:00,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:40:00,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:40:00,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:40:00,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:40:00,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:40:00,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:40:00,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:40:00,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:40:00,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:40:00,456 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 -> 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e [2024-11-09 10:40:00,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:40:00,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:40:00,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:40:00,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:40:00,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:40:00,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-09 10:40:02,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:40:02,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:40:02,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-09 10:40:02,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fabce2bf/ebaa41a97cbf42c6a78ce91b138b3cc9/FLAG3258c270f [2024-11-09 10:40:02,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fabce2bf/ebaa41a97cbf42c6a78ce91b138b3cc9 [2024-11-09 10:40:02,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:40:02,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:40:02,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:02,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:40:02,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:40:02,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:02" (1/1) ... [2024-11-09 10:40:02,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1324346b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:02, skipping insertion in model container [2024-11-09 10:40:02,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:02" (1/1) ... [2024-11-09 10:40:02,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:40:03,351 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:03,352 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:03,352 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:03,353 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:03,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:03,414 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:03,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ed3bf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:03, skipping insertion in model container [2024-11-09 10:40:03,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:03,416 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:40:03,418 INFO L158 Benchmark]: Toolchain (without parser) took 629.75ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 56.4MB in the beginning and 129.5MB in the end (delta: -73.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-09 10:40:03,419 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:40:03,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.63ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 56.1MB in the beginning and 129.5MB in the end (delta: -73.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-09 10:40:03,421 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.19ms. Allocated memory is still 130.0MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.63ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 56.1MB in the beginning and 129.5MB in the end (delta: -73.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1031]: 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_21-arrayloop2_nr.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 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:40:05,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:40:05,546 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:05,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:40:05,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:40:05,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:40:05,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:40:05,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:40:05,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:40:05,586 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:40:05,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:40:05,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:40:05,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:40:05,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:40:05,590 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:40:05,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:40:05,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:40:05,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:40:05,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:40:05,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:40:05,595 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:40:05,596 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:40:05,596 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:40:05,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:40:05,596 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:40:05,598 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:40:05,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:40:05,598 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:40:05,599 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:40:05,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:40:05,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:40:05,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:40:05,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:40:05,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:40:05,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:40:05,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:40:05,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:40:05,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:40:05,602 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:40:05,603 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:40:05,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:40:05,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:40:05,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:40:05,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:40:05,604 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 -> 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e [2024-11-09 10:40:05,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:40:05,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:40:05,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:40:05,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:40:05,959 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:40:05,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-09 10:40:07,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:40:07,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:40:07,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-09 10:40:07,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce7d33f8/74071c3d94ac4b1ba62dd140e6ddf558/FLAG6ae019061 [2024-11-09 10:40:07,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce7d33f8/74071c3d94ac4b1ba62dd140e6ddf558 [2024-11-09 10:40:07,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:40:07,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:40:07,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:07,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:40:07,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:40:07,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:07" (1/1) ... [2024-11-09 10:40:07,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb48a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:07, skipping insertion in model container [2024-11-09 10:40:07,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:07" (1/1) ... [2024-11-09 10:40:07,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:40:08,377 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,377 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,377 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,378 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:08,452 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:40:08,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:40:08,501 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,502 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,502 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,503 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:08,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:40:08,568 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,568 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,569 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,569 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:40:08,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:08,660 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:40:08,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:08 WrapperNode [2024-11-09 10:40:08,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:08,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:40:08,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:40:08,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:40:08,669 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:08" (1/1) ... [2024-11-09 10:40:08,699 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:08" (1/1) ... [2024-11-09 10:40:08,739 INFO L138 Inliner]: procedures = 274, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 181 [2024-11-09 10:40:08,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:40:08,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:40:08,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:40:08,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:40:08,755 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:08" (1/1) ... [2024-11-09 10:40:08,756 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:08" (1/1) ... [2024-11-09 10:40:08,764 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:08" (1/1) ... [2024-11-09 10:40:08,798 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:08,798 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:08" (1/1) ... [2024-11-09 10:40:08,798 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:08" (1/1) ... [2024-11-09 10:40:08,818 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:08" (1/1) ... [2024-11-09 10:40:08,822 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:08" (1/1) ... [2024-11-09 10:40:08,829 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:08" (1/1) ... [2024-11-09 10:40:08,834 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:08" (1/1) ... [2024-11-09 10:40:08,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:40:08,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:40:08,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:40:08,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:40:08,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:08" (1/1) ... [2024-11-09 10:40:08,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:40:08,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:40:08,886 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:08,889 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:08,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:40:08,939 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 10:40:08,939 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 10:40:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:40:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:40:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:40:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:40:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:40:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:40:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:40:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:40:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:40:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:40:08,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:40:08,946 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:09,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:40:09,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:40:09,894 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:40:09,894 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:40:11,220 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:40:11,220 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 10:40:11,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:11 BoogieIcfgContainer [2024-11-09 10:40:11,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:40:11,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:40:11,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:40:11,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:40:11,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:40:07" (1/3) ... [2024-11-09 10:40:11,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e66939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:40:11, skipping insertion in model container [2024-11-09 10:40:11,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:08" (2/3) ... [2024-11-09 10:40:11,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e66939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:40:11, skipping insertion in model container [2024-11-09 10:40:11,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:11" (3/3) ... [2024-11-09 10:40:11,229 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_21-arrayloop2_nr.i [2024-11-09 10:40:11,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:40:11,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-09 10:40:11,245 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:40:11,330 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:40:11,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 178 flow [2024-11-09 10:40:11,425 INFO L124 PetriNetUnfolderBase]: 6/83 cut-off events. [2024-11-09 10:40:11,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:40:11,429 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 327 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:11,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 178 flow [2024-11-09 10:40:11,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 172 flow [2024-11-09 10:40:11,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:40:11,454 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;@1b4d161f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:40:11,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-11-09 10:40:11,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:40:11,464 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:40:11,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:40:11,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:11,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:40:11,467 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:11,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash 494206, now seen corresponding path program 1 times [2024-11-09 10:40:11,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964510720] [2024-11-09 10:40:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:11,486 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:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:11,490 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:11,491 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:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:11,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:40:11,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:11,734 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:11,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:11,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:11,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964510720] [2024-11-09 10:40:11,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964510720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:11,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:11,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976174815] [2024-11-09 10:40:11,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:11,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:11,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:11,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 85 [2024-11-09 10:40:11,969 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:11,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:11,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 85 [2024-11-09 10:40:11,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:12,342 INFO L124 PetriNetUnfolderBase]: 482/954 cut-off events. [2024-11-09 10:40:12,342 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:40:12,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 954 events. 482/954 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5119 event pairs, 368 based on Foata normal form. 1/856 useless extension candidates. Maximal degree in co-relation 1678. Up to 752 conditions per place. [2024-11-09 10:40:12,352 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 34 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2024-11-09 10:40:12,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 238 flow [2024-11-09 10:40:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2024-11-09 10:40:12,395 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.638235294117647 [2024-11-09 10:40:12,401 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:12,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 238 flow [2024-11-09 10:40:12,404 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:12,411 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 168 flow [2024-11-09 10:40:12,416 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:12,423 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2024-11-09 10:40:12,423 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 168 flow [2024-11-09 10:40:12,423 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:12,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:12,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:40:12,431 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:12,624 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:12,625 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:12,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash 494207, now seen corresponding path program 1 times [2024-11-09 10:40:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592170805] [2024-11-09 10:40:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:12,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:12,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:12,631 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:12,632 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:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:12,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:40:12,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:12,813 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:12,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:12,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592170805] [2024-11-09 10:40:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592170805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311485301] [2024-11-09 10:40:12,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:12,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:12,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:12,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:12,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 85 [2024-11-09 10:40:12,990 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:12,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:12,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 85 [2024-11-09 10:40:12,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:13,301 INFO L124 PetriNetUnfolderBase]: 483/959 cut-off events. [2024-11-09 10:40:13,301 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:40:13,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 959 events. 483/959 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5059 event pairs, 368 based on Foata normal form. 3/864 useless extension candidates. Maximal degree in co-relation 1718. Up to 757 conditions per place. [2024-11-09 10:40:13,309 INFO L140 encePairwiseOnDemand]: 77/85 looper letters, 38 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2024-11-09 10:40:13,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 266 flow [2024-11-09 10:40:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2024-11-09 10:40:13,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-11-09 10:40:13,313 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:13,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 266 flow [2024-11-09 10:40:13,314 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:13,316 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 201 flow [2024-11-09 10:40:13,317 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:13,317 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:40:13,318 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 201 flow [2024-11-09 10:40:13,318 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:13,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:13,318 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:40:13,324 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:13,519 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:13,519 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:13,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1838436750, now seen corresponding path program 1 times [2024-11-09 10:40:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:13,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647892406] [2024-11-09 10:40:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:13,521 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,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:13,525 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:13,544 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:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:13,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:40:13,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:13,720 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:13,731 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,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:13,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:13,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647892406] [2024-11-09 10:40:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647892406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:13,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:13,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213746490] [2024-11-09 10:40:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:13,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:13,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:13,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:13,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:13,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 85 [2024-11-09 10:40:13,836 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:13,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:13,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 85 [2024-11-09 10:40:13,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:14,115 INFO L124 PetriNetUnfolderBase]: 483/958 cut-off events. [2024-11-09 10:40:14,116 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:40:14,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 958 events. 483/958 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5062 event pairs, 368 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 1724. Up to 753 conditions per place. [2024-11-09 10:40:14,125 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 36 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2024-11-09 10:40:14,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 277 flow [2024-11-09 10:40:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-11-09 10:40:14,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7176470588235294 [2024-11-09 10:40:14,130 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:14,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 277 flow [2024-11-09 10:40:14,132 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:14,135 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 202 flow [2024-11-09 10:40:14,135 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:14,136 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:40:14,136 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 202 flow [2024-11-09 10:40:14,136 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:14,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:14,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:40:14,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:40:14,340 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:14,341 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:14,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1838436749, now seen corresponding path program 1 times [2024-11-09 10:40:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:14,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427958312] [2024-11-09 10:40:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:14,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:14,346 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:14,347 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:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:14,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:40:14,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:14,496 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:14,502 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,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:14,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427958312] [2024-11-09 10:40:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427958312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:14,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927837987] [2024-11-09 10:40:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:14,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:14,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 85 [2024-11-09 10:40:14,580 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:14,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:14,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 85 [2024-11-09 10:40:14,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:14,898 INFO L124 PetriNetUnfolderBase]: 483/957 cut-off events. [2024-11-09 10:40:14,898 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 10:40:14,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 957 events. 483/957 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5048 event pairs, 368 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1723. Up to 753 conditions per place. [2024-11-09 10:40:14,905 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 36 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-11-09 10:40:14,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 278 flow [2024-11-09 10:40:14,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-11-09 10:40:14,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7176470588235294 [2024-11-09 10:40:14,909 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:14,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 278 flow [2024-11-09 10:40:14,910 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:14,911 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 200 flow [2024-11-09 10:40:14,912 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:14,912 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -2 predicate places. [2024-11-09 10:40:14,913 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 200 flow [2024-11-09 10:40:14,913 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:14,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:14,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:14,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:40:15,114 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:15,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:15,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1156964879, now seen corresponding path program 1 times [2024-11-09 10:40:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740931780] [2024-11-09 10:40:15,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:15,116 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,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:15,119 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:15,120 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:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:15,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:40:15,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:15,294 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,327 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,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:15,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740931780] [2024-11-09 10:40:15,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740931780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:15,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:15,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326391252] [2024-11-09 10:40:15,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:15,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:15,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:15,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:15,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:15,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 85 [2024-11-09 10:40:15,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 200 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:15,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:15,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 85 [2024-11-09 10:40:15,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:15,752 INFO L124 PetriNetUnfolderBase]: 483/955 cut-off events. [2024-11-09 10:40:15,753 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 10:40:15,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 955 events. 483/955 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5032 event pairs, 368 based on Foata normal form. 2/861 useless extension candidates. Maximal degree in co-relation 1721. Up to 755 conditions per place. [2024-11-09 10:40:15,762 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 37 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-09 10:40:15,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 278 flow [2024-11-09 10:40:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-11-09 10:40:15,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6441176470588236 [2024-11-09 10:40:15,765 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 200 flow. Second operand 4 states and 219 transitions. [2024-11-09 10:40:15,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 278 flow [2024-11-09 10:40:15,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:15,769 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 198 flow [2024-11-09 10:40:15,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=78, 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=198, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2024-11-09 10:40:15,771 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2024-11-09 10:40:15,772 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 198 flow [2024-11-09 10:40:15,773 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:15,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:15,773 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:15,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:40:15,976 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:15,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:15,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1156964878, now seen corresponding path program 1 times [2024-11-09 10:40:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305961494] [2024-11-09 10:40:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:15,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:40:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:15,980 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:15,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:40:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:16,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:40:16,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:16,111 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:16,123 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:16,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:16,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305961494] [2024-11-09 10:40:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305961494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:16,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202877847] [2024-11-09 10:40:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:16,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:16,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:16,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 85 [2024-11-09 10:40:16,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 198 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:16,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:16,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 85 [2024-11-09 10:40:16,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:16,491 INFO L124 PetriNetUnfolderBase]: 483/953 cut-off events. [2024-11-09 10:40:16,492 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:40:16,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 953 events. 483/953 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5016 event pairs, 368 based on Foata normal form. 1/860 useless extension candidates. Maximal degree in co-relation 1722. Up to 753 conditions per place. [2024-11-09 10:40:16,498 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 34 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2024-11-09 10:40:16,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 77 transitions, 276 flow [2024-11-09 10:40:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:40:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:40:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2024-11-09 10:40:16,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5976470588235294 [2024-11-09 10:40:16,501 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 198 flow. Second operand 5 states and 254 transitions. [2024-11-09 10:40:16,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 77 transitions, 276 flow [2024-11-09 10:40:16,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:40:16,503 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 200 flow [2024-11-09 10:40:16,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=76, 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=200, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2024-11-09 10:40:16,503 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2024-11-09 10:40:16,504 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 200 flow [2024-11-09 10:40:16,504 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:16,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:16,504 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:40:16,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:16,704 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:16,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:16,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1156966887, now seen corresponding path program 1 times [2024-11-09 10:40:16,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:16,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414008059] [2024-11-09 10:40:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:16,706 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,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:16,707 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:16,709 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:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:16,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:40:16,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:16,813 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,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:16,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414008059] [2024-11-09 10:40:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414008059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:16,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:16,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244385801] [2024-11-09 10:40:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:16,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:16,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:16,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:16,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-09 10:40:16,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 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,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:16,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-09 10:40:16,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:17,021 INFO L124 PetriNetUnfolderBase]: 482/971 cut-off events. [2024-11-09 10:40:17,022 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 10:40:17,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 971 events. 482/971 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5066 event pairs, 368 based on Foata normal form. 2/871 useless extension candidates. Maximal degree in co-relation 1749. Up to 753 conditions per place. [2024-11-09 10:40:17,027 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 40 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-11-09 10:40:17,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 300 flow [2024-11-09 10:40:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-11-09 10:40:17,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7490196078431373 [2024-11-09 10:40:17,029 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 200 flow. Second operand 3 states and 191 transitions. [2024-11-09 10:40:17,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 300 flow [2024-11-09 10:40:17,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:40:17,031 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 197 flow [2024-11-09 10:40:17,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2024-11-09 10:40:17,032 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2024-11-09 10:40:17,032 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 197 flow [2024-11-09 10:40:17,032 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:17,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:17,032 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:17,037 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:17,233 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:17,233 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:17,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash -553268497, now seen corresponding path program 1 times [2024-11-09 10:40:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915952416] [2024-11-09 10:40:17,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:17,234 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,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:17,235 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:17,237 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:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:17,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:40:17,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:17,739 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:40:17,739 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 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 10:40:17,784 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,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:17,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915952416] [2024-11-09 10:40:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915952416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:17,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:17,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266227079] [2024-11-09 10:40:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:17,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:17,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 85 [2024-11-09 10:40:17,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:17,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 85 [2024-11-09 10:40:17,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:18,156 INFO L124 PetriNetUnfolderBase]: 482/967 cut-off events. [2024-11-09 10:40:18,156 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-09 10:40:18,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 967 events. 482/967 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5024 event pairs, 368 based on Foata normal form. 2/871 useless extension candidates. Maximal degree in co-relation 1742. Up to 755 conditions per place. [2024-11-09 10:40:18,162 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 35 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-11-09 10:40:18,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 271 flow [2024-11-09 10:40:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2024-11-09 10:40:18,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-11-09 10:40:18,164 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 197 flow. Second operand 4 states and 221 transitions. [2024-11-09 10:40:18,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 271 flow [2024-11-09 10:40:18,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:18,167 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 198 flow [2024-11-09 10:40:18,167 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2024-11-09 10:40:18,167 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2024-11-09 10:40:18,168 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 198 flow [2024-11-09 10:40:18,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:18,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:18,178 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:18,369 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:18,369 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:18,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash -553268496, now seen corresponding path program 1 times [2024-11-09 10:40:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:18,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326540506] [2024-11-09 10:40:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:18,371 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,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:18,374 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:18,374 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:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:18,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:40:18,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:18,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:40:18,942 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:19,005 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:19,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:19,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326540506] [2024-11-09 10:40:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326540506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621084510] [2024-11-09 10:40:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:19,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:40:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:19,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:40:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:40:19,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 85 [2024-11-09 10:40:19,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:19,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 85 [2024-11-09 10:40:19,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:19,614 INFO L124 PetriNetUnfolderBase]: 483/997 cut-off events. [2024-11-09 10:40:19,614 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-09 10:40:19,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 997 events. 483/997 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5394 event pairs, 368 based on Foata normal form. 2/887 useless extension candidates. Maximal degree in co-relation 1741. Up to 761 conditions per place. [2024-11-09 10:40:19,621 INFO L140 encePairwiseOnDemand]: 79/85 looper letters, 43 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2024-11-09 10:40:19,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 82 transitions, 324 flow [2024-11-09 10:40:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2024-11-09 10:40:19,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6794117647058824 [2024-11-09 10:40:19,625 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 198 flow. Second operand 4 states and 231 transitions. [2024-11-09 10:40:19,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 82 transitions, 324 flow [2024-11-09 10:40:19,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:40:19,627 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 236 flow [2024-11-09 10:40:19,628 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2024-11-09 10:40:19,629 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2024-11-09 10:40:19,629 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 236 flow [2024-11-09 10:40:19,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:19,630 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:19,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 10:40:19,830 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:19,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:19,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash 28546343, now seen corresponding path program 1 times [2024-11-09 10:40:19,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:19,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864765486] [2024-11-09 10:40:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:19,832 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,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:19,834 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:19,836 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:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:20,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:40:20,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:20,477 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:20,483 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:20,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 11 [2024-11-09 10:40:20,555 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:20,628 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 10:40:20,629 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,644 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:40:20,644 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,704 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:20,725 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:20,767 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:20,777 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:20,809 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:20,814 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:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:20,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:20,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:20,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864765486] [2024-11-09 10:40:20,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864765486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:20,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:20,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:40:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560305791] [2024-11-09 10:40:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:20,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:40:20,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:40:20,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:40:21,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 85 [2024-11-09 10:40:21,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 236 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:21,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:21,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 85 [2024-11-09 10:40:21,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:22,323 INFO L124 PetriNetUnfolderBase]: 483/996 cut-off events. [2024-11-09 10:40:22,323 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-09 10:40:22,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 996 events. 483/996 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5365 event pairs, 368 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 1775. Up to 774 conditions per place. [2024-11-09 10:40:22,330 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 59 selfloop transitions, 10 changer transitions 0/95 dead transitions. [2024-11-09 10:40:22,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 95 transitions, 412 flow [2024-11-09 10:40:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:40:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:40:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 379 transitions. [2024-11-09 10:40:22,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44588235294117645 [2024-11-09 10:40:22,333 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 236 flow. Second operand 10 states and 379 transitions. [2024-11-09 10:40:22,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 95 transitions, 412 flow [2024-11-09 10:40:22,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:22,336 INFO L231 Difference]: Finished difference. Result has 94 places, 83 transitions, 286 flow [2024-11-09 10:40:22,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=286, PETRI_PLACES=94, PETRI_TRANSITIONS=83} [2024-11-09 10:40:22,337 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2024-11-09 10:40:22,337 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 83 transitions, 286 flow [2024-11-09 10:40:22,337 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:22,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:22,338 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:22,345 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:22,538 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:22,539 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash 28546342, now seen corresponding path program 1 times [2024-11-09 10:40:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:22,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663757332] [2024-11-09 10:40:22,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:22,540 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:22,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:22,543 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:22,544 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:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:23,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:40:23,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:23,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:40:23,184 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 37 treesize of output 15 [2024-11-09 10:40:23,233 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:40:23,234 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:23,271 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:23,304 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:23,322 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:23,364 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:23,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:23,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:23,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663757332] [2024-11-09 10:40:23,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663757332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:23,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:23,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:40:23,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241310644] [2024-11-09 10:40:23,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:23,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:40:23,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:23,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:40:23,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:40:24,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 85 [2024-11-09 10:40:24,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 83 transitions, 286 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:24,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:24,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 85 [2024-11-09 10:40:24,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:24,705 INFO L124 PetriNetUnfolderBase]: 483/994 cut-off events. [2024-11-09 10:40:24,706 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-09 10:40:24,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 994 events. 483/994 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5362 event pairs, 368 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1809. Up to 767 conditions per place. [2024-11-09 10:40:24,711 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 43 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2024-11-09 10:40:24,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 91 transitions, 432 flow [2024-11-09 10:40:24,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:40:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:40:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 458 transitions. [2024-11-09 10:40:24,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4898395721925134 [2024-11-09 10:40:24,713 INFO L175 Difference]: Start difference. First operand has 94 places, 83 transitions, 286 flow. Second operand 11 states and 458 transitions. [2024-11-09 10:40:24,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 91 transitions, 432 flow [2024-11-09 10:40:24,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 91 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:24,716 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 367 flow [2024-11-09 10:40:24,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=367, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2024-11-09 10:40:24,717 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2024-11-09 10:40:24,717 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 367 flow [2024-11-09 10:40:24,717 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:24,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:24,717 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:24,723 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:24,918 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:24,918 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:24,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:24,918 INFO L85 PathProgramCache]: Analyzing trace with hash 884937069, now seen corresponding path program 1 times [2024-11-09 10:40:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:24,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591838751] [2024-11-09 10:40:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:24,919 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:24,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:24,920 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:24,921 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:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:25,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:40:25,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:25,087 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:25,128 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:25,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:25,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:25,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591838751] [2024-11-09 10:40:25,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591838751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:25,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:25,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:25,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815097649] [2024-11-09 10:40:25,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:25,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:25,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:25,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:25,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:25,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 85 [2024-11-09 10:40:25,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 367 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:25,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:25,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 85 [2024-11-09 10:40:25,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:25,449 INFO L124 PetriNetUnfolderBase]: 483/986 cut-off events. [2024-11-09 10:40:25,449 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-09 10:40:25,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 986 events. 483/986 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5288 event pairs, 368 based on Foata normal form. 8/899 useless extension candidates. Maximal degree in co-relation 1815. Up to 754 conditions per place. [2024-11-09 10:40:25,454 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 39 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-11-09 10:40:25,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 86 transitions, 463 flow [2024-11-09 10:40:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2024-11-09 10:40:25,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-11-09 10:40:25,457 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 367 flow. Second operand 4 states and 225 transitions. [2024-11-09 10:40:25,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 86 transitions, 463 flow [2024-11-09 10:40:25,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 86 transitions, 441 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-09 10:40:25,460 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 363 flow [2024-11-09 10:40:25,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2024-11-09 10:40:25,460 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 19 predicate places. [2024-11-09 10:40:25,461 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 363 flow [2024-11-09 10:40:25,461 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:25,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:25,461 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:25,469 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:25,661 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:25,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:25,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash 884937068, now seen corresponding path program 1 times [2024-11-09 10:40:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148143265] [2024-11-09 10:40:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:25,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:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:25,664 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:25,665 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:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:25,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:40:25,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:25,830 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:25,847 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:25,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:40:25,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148143265] [2024-11-09 10:40:25,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148143265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:25,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:25,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:25,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187087190] [2024-11-09 10:40:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:25,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:40:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:25,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:40:25,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:40:25,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 85 [2024-11-09 10:40:25,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 363 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:25,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:25,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 85 [2024-11-09 10:40:25,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:26,154 INFO L124 PetriNetUnfolderBase]: 483/978 cut-off events. [2024-11-09 10:40:26,154 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2024-11-09 10:40:26,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 978 events. 483/978 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5212 event pairs, 368 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1815. Up to 754 conditions per place. [2024-11-09 10:40:26,162 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 41 selfloop transitions, 11 changer transitions 0/84 dead transitions. [2024-11-09 10:40:26,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 84 transitions, 463 flow [2024-11-09 10:40:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-11-09 10:40:26,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6441176470588236 [2024-11-09 10:40:26,164 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 363 flow. Second operand 4 states and 219 transitions. [2024-11-09 10:40:26,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 84 transitions, 463 flow [2024-11-09 10:40:26,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 84 transitions, 441 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:40:26,168 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 359 flow [2024-11-09 10:40:26,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=359, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2024-11-09 10:40:26,168 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 17 predicate places. [2024-11-09 10:40:26,170 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 359 flow [2024-11-09 10:40:26,170 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:26,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:26,170 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:26,177 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:26,370 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:26,371 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:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1090895849, now seen corresponding path program 1 times [2024-11-09 10:40:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479402606] [2024-11-09 10:40:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:26,372 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,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:26,373 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:26,375 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:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:26,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:40:26,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:26,638 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:26,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:26,694 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:26,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479402606] [2024-11-09 10:40:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479402606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:26,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:40:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107897253] [2024-11-09 10:40:26,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:26,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:40:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:40:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:40:26,696 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-09 10:40:26,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 359 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:26,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:26,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-09 10:40:26,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:27,058 INFO L124 PetriNetUnfolderBase]: 483/1028 cut-off events. [2024-11-09 10:40:27,059 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-11-09 10:40:27,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1028 events. 483/1028 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5199 event pairs, 368 based on Foata normal form. 6/942 useless extension candidates. Maximal degree in co-relation 1941. Up to 750 conditions per place. [2024-11-09 10:40:27,073 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 54 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2024-11-09 10:40:27,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 601 flow [2024-11-09 10:40:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:40:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:40:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 354 transitions. [2024-11-09 10:40:27,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-11-09 10:40:27,076 INFO L175 Difference]: Start difference. First operand has 101 places, 84 transitions, 359 flow. Second operand 6 states and 354 transitions. [2024-11-09 10:40:27,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 601 flow [2024-11-09 10:40:27,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 557 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:40:27,081 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 425 flow [2024-11-09 10:40:27,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2024-11-09 10:40:27,082 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2024-11-09 10:40:27,082 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 425 flow [2024-11-09 10:40:27,083 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:27,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:27,083 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:27,096 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:27,283 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:27,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:27,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1079857398, now seen corresponding path program 1 times [2024-11-09 10:40:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473544778] [2024-11-09 10:40:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:27,285 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,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:27,286 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:27,287 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:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:27,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:40:27,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:27,977 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:28,081 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:28,156 INFO L349 Elim1Store]: treesize reduction 90, result has 30.2 percent of original size [2024-11-09 10:40:28,157 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 36 treesize of output 52 [2024-11-09 10:40:28,221 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:28,275 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:28,302 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:28,336 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 19 treesize of output 11 [2024-11-09 10:40:28,354 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:28,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:28,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_49| (_ BitVec 32)) (v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_49|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_49| v_ArrVal_571) (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_new_~p~0#1.base_49| v_ArrVal_574) |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:28,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:28,560 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:28,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:28,579 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:28,586 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:29,984 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,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473544778] [2024-11-09 10:40:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473544778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:29,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:29,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-09 10:40:29,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673570015] [2024-11-09 10:40:29,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:29,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:40:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:40:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=190, Unknown=10, NotChecked=28, Total=272 [2024-11-09 10:40:30,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 85 [2024-11-09 10:40:30,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 425 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:30,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:30,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 85 [2024-11-09 10:40:30,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:31,842 INFO L124 PetriNetUnfolderBase]: 1518/2684 cut-off events. [2024-11-09 10:40:31,842 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2024-11-09 10:40:31,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 2684 events. 1518/2684 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15284 event pairs, 1287 based on Foata normal form. 0/1901 useless extension candidates. Maximal degree in co-relation 5234. Up to 2339 conditions per place. [2024-11-09 10:40:31,861 INFO L140 encePairwiseOnDemand]: 76/85 looper letters, 62 selfloop transitions, 22 changer transitions 0/94 dead transitions. [2024-11-09 10:40:31,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 94 transitions, 607 flow [2024-11-09 10:40:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:40:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:40:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-11-09 10:40:31,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21497326203208555 [2024-11-09 10:40:31,865 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 425 flow. Second operand 11 states and 201 transitions. [2024-11-09 10:40:31,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 94 transitions, 607 flow [2024-11-09 10:40:31,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 94 transitions, 589 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:31,868 INFO L231 Difference]: Finished difference. Result has 115 places, 88 transitions, 447 flow [2024-11-09 10:40:31,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=447, PETRI_PLACES=115, PETRI_TRANSITIONS=88} [2024-11-09 10:40:31,869 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 31 predicate places. [2024-11-09 10:40:31,869 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 88 transitions, 447 flow [2024-11-09 10:40:31,870 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:31,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:31,870 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:31,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 10:40:32,070 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:32,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 10:40:32,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1079857399, now seen corresponding path program 1 times [2024-11-09 10:40:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:32,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326557009] [2024-11-09 10:40:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:32,072 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:32,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:32,073 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:32,074 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:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:32,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 10:40:32,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:32,862 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:32,868 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:33,098 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:33,108 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:33,182 INFO L349 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2024-11-09 10:40:33,183 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 28 treesize of output 30 [2024-11-09 10:40:33,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 10:40:33,247 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 34 treesize of output 27 [2024-11-09 10:40:33,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 10:40:33,315 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:33,325 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 34 treesize of output 27 [2024-11-09 10:40:33,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 10:40:33,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 10:40:33,387 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:33,411 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:33,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:33,526 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_681 (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_681) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_682 (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_681) |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_682) |c_~#c~0.base|) .cse1)))))) is different from false [2024-11-09 10:40:33,568 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_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_682 (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_681) |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_682) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_681 (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_681) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-09 10:40:33,633 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_ULTIMATE.start_new_~p~0#1.base_52| (_ BitVec 32))) (or (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_676 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_681) |c_~#c~0.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_676) (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_682) |c_~#c~0.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_52|))))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_52| (_ BitVec 32))) (or (forall ((v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_new_~p~0#1.base_52| v_ArrVal_681) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_52|))))))) is different from false [2024-11-09 10:40:33,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:33,656 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 48 treesize of output 49 [2024-11-09 10:40:33,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:33,667 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 40 treesize of output 41 [2024-11-09 10:40:33,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:33,689 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 74 treesize of output 77 [2024-11-09 10:40:33,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:33,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 113 [2024-11-09 10:40:33,738 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 26 treesize of output 20 [2024-11-09 10:40:33,748 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:34,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:34,264 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 45 treesize of output 38 [2024-11-09 10:40:34,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:40:34,283 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 60 treesize of output 55 [2024-11-09 10:40:34,294 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 23 treesize of output 11 [2024-11-09 10:40:36,730 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-11-09 10:40:36,730 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 74 treesize of output 1 [2024-11-09 10:40:36,731 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:36,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326557009] [2024-11-09 10:40:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326557009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:36,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:36,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2024-11-09 10:40:36,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333911432] [2024-11-09 10:40:36,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:36,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:40:36,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:36,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:40:36,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=200, Unknown=3, NotChecked=90, Total=342 [2024-11-09 10:40:36,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2024-11-09 10:40:36,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 88 transitions, 447 flow. Second operand has 19 states, 19 states have (on average 8.0) internal successors, (152), 19 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:36,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:36,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2024-11-09 10:40:36,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:40,652 INFO L124 PetriNetUnfolderBase]: 2199/3495 cut-off events. [2024-11-09 10:40:40,652 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-11-09 10:40:40,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7239 conditions, 3495 events. 2199/3495 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18247 event pairs, 1920 based on Foata normal form. 6/2091 useless extension candidates. Maximal degree in co-relation 7145. Up to 3398 conditions per place. [2024-11-09 10:40:40,670 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 63 selfloop transitions, 26 changer transitions 0/93 dead transitions. [2024-11-09 10:40:40,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 93 transitions, 639 flow [2024-11-09 10:40:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:40:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:40:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 158 transitions. [2024-11-09 10:40:40,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.13277310924369748 [2024-11-09 10:40:40,674 INFO L175 Difference]: Start difference. First operand has 115 places, 88 transitions, 447 flow. Second operand 14 states and 158 transitions. [2024-11-09 10:40:40,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 93 transitions, 639 flow [2024-11-09 10:40:40,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 93 transitions, 556 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-09 10:40:40,678 INFO L231 Difference]: Finished difference. Result has 117 places, 90 transitions, 430 flow [2024-11-09 10:40:40,678 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=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=430, PETRI_PLACES=117, PETRI_TRANSITIONS=90} [2024-11-09 10:40:40,679 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 33 predicate places. [2024-11-09 10:40:40,679 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 90 transitions, 430 flow [2024-11-09 10:40:40,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.0) internal successors, (152), 19 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:40,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:40,679 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:40,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:40,880 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:40,880 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:40,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash -735029785, now seen corresponding path program 2 times [2024-11-09 10:40:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:40,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964879192] [2024-11-09 10:40:40,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:40:40,881 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,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:40,884 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:40,885 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:41,480 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:40:41,480 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:40:41,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:40:41,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:41,563 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:41,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:41,657 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:41,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:41,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964879192] [2024-11-09 10:40:41,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964879192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:41,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:41,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:40:41,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403079094] [2024-11-09 10:40:41,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:41,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:40:41,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:41,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:40:41,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:40:41,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-09 10:40:41,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 90 transitions, 430 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:41,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:41,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-09 10:40:41,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:42,506 INFO L124 PetriNetUnfolderBase]: 483/1136 cut-off events. [2024-11-09 10:40:42,506 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2024-11-09 10:40:42,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 1136 events. 483/1136 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5174 event pairs, 368 based on Foata normal form. 12/1062 useless extension candidates. Maximal degree in co-relation 2400. Up to 750 conditions per place. [2024-11-09 10:40:42,513 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 84 selfloop transitions, 23 changer transitions 0/142 dead transitions. [2024-11-09 10:40:42,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 142 transitions, 1088 flow [2024-11-09 10:40:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:40:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:40:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 687 transitions. [2024-11-09 10:40:42,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6735294117647059 [2024-11-09 10:40:42,517 INFO L175 Difference]: Start difference. First operand has 117 places, 90 transitions, 430 flow. Second operand 12 states and 687 transitions. [2024-11-09 10:40:42,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 142 transitions, 1088 flow [2024-11-09 10:40:42,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 142 transitions, 936 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-09 10:40:42,522 INFO L231 Difference]: Finished difference. Result has 124 places, 103 transitions, 610 flow [2024-11-09 10:40:42,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=610, PETRI_PLACES=124, PETRI_TRANSITIONS=103} [2024-11-09 10:40:42,523 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 40 predicate places. [2024-11-09 10:40:42,523 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 103 transitions, 610 flow [2024-11-09 10:40:42,523 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:42,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:42,524 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:42,540 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 (18)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:42,725 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:42,725 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:42,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:42,726 INFO L85 PathProgramCache]: Analyzing trace with hash -857425945, now seen corresponding path program 3 times [2024-11-09 10:40:42,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:40:42,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210972738] [2024-11-09 10:40:42,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:40:42,727 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:42,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:40:42,728 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:42,730 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:40:58,410 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-09 10:40:58,410 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:40:58,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:40:58,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:58,657 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:40:58,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:58,989 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:40:58,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:40:58,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210972738] [2024-11-09 10:40:58,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210972738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:58,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:40:58,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-09 10:40:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940682591] [2024-11-09 10:40:58,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:58,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:40:58,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:40:58,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:40:58,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:40:58,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 85 [2024-11-09 10:40:58,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 103 transitions, 610 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:40:58,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:58,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 85 [2024-11-09 10:40:58,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:01,460 INFO L124 PetriNetUnfolderBase]: 483/1376 cut-off events. [2024-11-09 10:41:01,460 INFO L125 PetriNetUnfolderBase]: For 1758/1758 co-relation queries the response was YES. [2024-11-09 10:41:01,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 1376 events. 483/1376 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5205 event pairs, 368 based on Foata normal form. 24/1314 useless extension candidates. Maximal degree in co-relation 3202. Up to 750 conditions per place. [2024-11-09 10:41:01,465 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 144 selfloop transitions, 47 changer transitions 0/226 dead transitions. [2024-11-09 10:41:01,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 226 transitions, 1936 flow [2024-11-09 10:41:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 10:41:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-09 10:41:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1353 transitions. [2024-11-09 10:41:01,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.663235294117647 [2024-11-09 10:41:01,471 INFO L175 Difference]: Start difference. First operand has 124 places, 103 transitions, 610 flow. Second operand 24 states and 1353 transitions. [2024-11-09 10:41:01,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 226 transitions, 1936 flow [2024-11-09 10:41:01,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 226 transitions, 1924 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:41:01,480 INFO L231 Difference]: Finished difference. Result has 157 places, 128 transitions, 1142 flow [2024-11-09 10:41:01,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1142, PETRI_PLACES=157, PETRI_TRANSITIONS=128} [2024-11-09 10:41:01,481 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 73 predicate places. [2024-11-09 10:41:01,481 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 128 transitions, 1142 flow [2024-11-09 10:41:01,482 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:01,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:01,482 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:01,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 10:41:01,682 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:01,682 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:01,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:01,683 INFO L85 PathProgramCache]: Analyzing trace with hash -933954585, now seen corresponding path program 4 times [2024-11-09 10:41:01,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:41:01,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166255025] [2024-11-09 10:41:01,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:41:01,684 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:01,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:41:01,686 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:01,687 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