./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:55:48,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:55:48,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:55:48,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:55:48,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:55:48,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:55:48,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:55:48,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:55:48,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:55:48,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:55:48,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:55:48,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:55:48,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:55:48,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:55:48,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:55:48,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:55:48,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:55:48,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:55:48,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:55:48,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:55:48,743 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:55:48,744 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:55:48,744 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:55:48,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:55:48,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:55:48,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:55:48,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:55:48,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:55:48,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:55:48,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:55:48,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:55:48,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:55:48,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:55:48,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:55:48,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:55:48,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:55:48,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:55:48,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:55:48,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:55:48,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:55:48,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:55:48,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:55:48,753 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-clean/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-clean/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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2024-10-11 19:55:48,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:55:49,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:55:49,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:55:49,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:55:49,004 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:55:49,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-10-11 19:55:50,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:55:50,464 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:55:50,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-10-11 19:55:50,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6f47c0780/b0779ceb4aca44b3bcfb9dfa0ee3ab05/FLAG919d8b2fb [2024-10-11 19:55:50,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6f47c0780/b0779ceb4aca44b3bcfb9dfa0ee3ab05 [2024-10-11 19:55:50,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:55:50,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:55:50,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:55:50,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:55:50,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:55:50,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:55:50" (1/1) ... [2024-10-11 19:55:50,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17265fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:50, skipping insertion in model container [2024-10-11 19:55:50,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:55:50" (1/1) ... [2024-10-11 19:55:50,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:55:50,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:55:50,697 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:55:50,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ff9643e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:50, skipping insertion in model container [2024-10-11 19:55:50,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:55:50,699 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:55:50,700 INFO L158 Benchmark]: Toolchain (without parser) took 211.57ms. Allocated memory is still 180.4MB. Free memory was 114.3MB in the beginning and 102.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 19:55:50,701 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:55:50,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.40ms. Allocated memory is still 180.4MB. Free memory was 114.2MB in the beginning and 102.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 19:55:50,702 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.14ms. Allocated memory is still 109.1MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.40ms. Allocated memory is still 180.4MB. Free memory was 114.2MB in the beginning and 102.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 159]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:55:52,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:55:52,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:55:52,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:55:52,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:55:52,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:55:52,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:55:52,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:55:52,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:55:52,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:55:52,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:55:52,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:55:52,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:55:52,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:55:52,875 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:55:52,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:55:52,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:55:52,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:55:52,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:55:52,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:55:52,879 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:55:52,879 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:55:52,879 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:55:52,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:55:52,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:55:52,879 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:55:52,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:55:52,880 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:55:52,880 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:55:52,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:55:52,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:55:52,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:55:52,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:55:52,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:55:52,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:55:52,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:55:52,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:55:52,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:55:52,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:55:52,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:55:52,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:55:52,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:55:52,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:55:52,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:55:52,884 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:55:52,884 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-clean/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-clean/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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2024-10-11 19:55:53,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:55:53,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:55:53,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:55:53,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:55:53,187 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:55:53,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-10-11 19:55:54,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:55:54,946 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:55:54,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-10-11 19:55:54,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4bea6a5a0/5c7569c0c9e4484eb2b312dbe7ec7e4f/FLAG020669f90 [2024-10-11 19:55:54,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4bea6a5a0/5c7569c0c9e4484eb2b312dbe7ec7e4f [2024-10-11 19:55:54,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:55:54,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:55:54,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:55:54,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:55:54,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:55:54,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:55:54" (1/1) ... [2024-10-11 19:55:54,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454e607a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:54, skipping insertion in model container [2024-10-11 19:55:54,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:55:54" (1/1) ... [2024-10-11 19:55:55,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:55:55,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:55:55,220 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:55:55,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:55:55,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:55:55,260 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:55:55,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:55:55,315 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:55:55,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55 WrapperNode [2024-10-11 19:55:55,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:55:55,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:55:55,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:55:55,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:55:55,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,372 INFO L138 Inliner]: procedures = 27, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 296 [2024-10-11 19:55:55,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:55:55,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:55:55,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:55:55,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:55:55,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,442 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-10-11 19:55:55,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:55:55,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:55:55,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:55:55,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:55:55,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (1/1) ... [2024-10-11 19:55:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:55:55,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:55:55,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:55:55,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:55:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:55:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:55:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:55:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:55:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:55:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 19:55:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 19:55:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 19:55:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 19:55:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 19:55:55,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 19:55:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-11 19:55:55,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-11 19:55:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:55:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:55:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:55:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:55:55,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:55:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:55:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:55:55,547 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:55:55,676 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:55:55,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:55:56,173 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:55:56,174 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:55:56,562 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:55:56,562 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 19:55:56,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:55:56 BoogieIcfgContainer [2024-10-11 19:55:56,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:55:56,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:55:56,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:55:56,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:55:56,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:55:54" (1/3) ... [2024-10-11 19:55:56,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f37fb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:55:56, skipping insertion in model container [2024-10-11 19:55:56,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:55:55" (2/3) ... [2024-10-11 19:55:56,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f37fb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:55:56, skipping insertion in model container [2024-10-11 19:55:56,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:55:56" (3/3) ... [2024-10-11 19:55:56,572 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2024-10-11 19:55:56,586 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:55:56,586 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-11 19:55:56,586 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:55:56,650 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 19:55:56,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 156 flow [2024-10-11 19:55:56,707 INFO L124 PetriNetUnfolderBase]: 6/60 cut-off events. [2024-10-11 19:55:56,708 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 19:55:56,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 6/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-10-11 19:55:56,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 156 flow [2024-10-11 19:55:56,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 59 transitions, 142 flow [2024-10-11 19:55:56,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:55:56,739 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;@956088b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:55:56,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-10-11 19:55:56,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:55:56,742 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-11 19:55:56,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:55:56,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:55:56,743 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:55:56,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:55:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:55:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash 862952, now seen corresponding path program 1 times [2024-10-11 19:55:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:55:56,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009935652] [2024-10-11 19:55:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:55:56,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:55:56,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:55:56,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:55:56,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:55:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:55:56,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:55:56,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:55:56,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:55:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:55:56,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:55:56,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:55:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009935652] [2024-10-11 19:55:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009935652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:55:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:55:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:55:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625807639] [2024-10-11 19:55:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:55:56,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:55:56,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:55:56,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:55:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:55:56,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:55:56,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:55:56,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:55:56,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:55:56,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:55:58,224 INFO L124 PetriNetUnfolderBase]: 4566/6759 cut-off events. [2024-10-11 19:55:58,224 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2024-10-11 19:55:58,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13365 conditions, 6759 events. 4566/6759 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 49936 event pairs, 4408 based on Foata normal form. 1/3792 useless extension candidates. Maximal degree in co-relation 12180. Up to 6127 conditions per place. [2024-10-11 19:55:58,277 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 34 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-10-11 19:55:58,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 206 flow [2024-10-11 19:55:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:55:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:55:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-10-11 19:55:58,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125 [2024-10-11 19:55:58,289 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 142 flow. Second operand 3 states and 111 transitions. [2024-10-11 19:55:58,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 206 flow [2024-10-11 19:55:58,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 190 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 19:55:58,304 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 122 flow [2024-10-11 19:55:58,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2024-10-11 19:55:58,309 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-10-11 19:55:58,309 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 122 flow [2024-10-11 19:55:58,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:55:58,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:55:58,310 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:55:58,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:55:58,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:55:58,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:55:58,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:55:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash 862953, now seen corresponding path program 1 times [2024-10-11 19:55:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:55:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018452156] [2024-10-11 19:55:58,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:55:58,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:55:58,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:55:58,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:55:58,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:55:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:55:58,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:55:58,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:55:58,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 19:55:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:55:58,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:55:58,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:55:58,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018452156] [2024-10-11 19:55:58,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018452156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:55:58,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:55:58,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:55:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906594609] [2024-10-11 19:55:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:55:58,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:55:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:55:58,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:55:58,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:55:58,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:55:58,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:55:58,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:55:58,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:55:58,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:55:59,625 INFO L124 PetriNetUnfolderBase]: 4568/6765 cut-off events. [2024-10-11 19:55:59,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:55:59,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13067 conditions, 6765 events. 4568/6765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 49895 event pairs, 4408 based on Foata normal form. 0/3795 useless extension candidates. Maximal degree in co-relation 13031. Up to 6136 conditions per place. [2024-10-11 19:55:59,679 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 37 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2024-10-11 19:55:59,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 224 flow [2024-10-11 19:55:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:55:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:55:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-10-11 19:55:59,683 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5546875 [2024-10-11 19:55:59,683 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 122 flow. Second operand 4 states and 142 transitions. [2024-10-11 19:55:59,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 224 flow [2024-10-11 19:55:59,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:55:59,686 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 174 flow [2024-10-11 19:55:59,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2024-10-11 19:55:59,687 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2024-10-11 19:55:59,687 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 174 flow [2024-10-11 19:55:59,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:55:59,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:55:59,688 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-10-11 19:55:59,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:55:59,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:55:59,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:55:59,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:55:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash 829325677, now seen corresponding path program 1 times [2024-10-11 19:55:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:55:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128074553] [2024-10-11 19:55:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:55:59,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:55:59,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:55:59,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:55:59,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:55:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:55:59,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:55:59,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:55:59,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 19:56:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:00,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:56:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:00,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:00,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128074553] [2024-10-11 19:56:00,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128074553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:56:00,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:56:00,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-11 19:56:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359356935] [2024-10-11 19:56:00,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:56:00,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:56:00,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:00,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:56:00,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:56:00,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:56:00,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 174 flow. Second operand has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:00,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:00,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:56:00,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:01,836 INFO L124 PetriNetUnfolderBase]: 4574/6783 cut-off events. [2024-10-11 19:56:01,836 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 19:56:01,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13145 conditions, 6783 events. 4574/6783 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 49960 event pairs, 4408 based on Foata normal form. 0/3811 useless extension candidates. Maximal degree in co-relation 13042. Up to 6139 conditions per place. [2024-10-11 19:56:01,920 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 37 selfloop transitions, 25 changer transitions 0/79 dead transitions. [2024-10-11 19:56:01,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 376 flow [2024-10-11 19:56:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:56:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:56:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 308 transitions. [2024-10-11 19:56:01,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-10-11 19:56:01,927 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 174 flow. Second operand 10 states and 308 transitions. [2024-10-11 19:56:01,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 376 flow [2024-10-11 19:56:01,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 376 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:56:01,930 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 336 flow [2024-10-11 19:56:01,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=336, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2024-10-11 19:56:01,930 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2024-10-11 19:56:01,930 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 336 flow [2024-10-11 19:56:01,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:01,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:01,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:56:01,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:56:02,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:02,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1326482596, now seen corresponding path program 1 times [2024-10-11 19:56:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:02,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751532421] [2024-10-11 19:56:02,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:56:02,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:02,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:02,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:02,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:56:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:56:02,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:56:02,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:02,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:56:02,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751532421] [2024-10-11 19:56:02,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751532421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:56:02,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:56:02,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:56:02,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537651971] [2024-10-11 19:56:02,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:56:02,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:56:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:56:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:56:02,269 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-10-11 19:56:02,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:02,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:02,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-10-11 19:56:02,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:03,334 INFO L124 PetriNetUnfolderBase]: 5243/7895 cut-off events. [2024-10-11 19:56:03,334 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 19:56:03,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15363 conditions, 7895 events. 5243/7895 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 59666 event pairs, 5051 based on Foata normal form. 249/4938 useless extension candidates. Maximal degree in co-relation 15275. Up to 6154 conditions per place. [2024-10-11 19:56:03,370 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 95 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2024-10-11 19:56:03,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 117 transitions, 688 flow [2024-10-11 19:56:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:56:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:56:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2024-10-11 19:56:03,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68359375 [2024-10-11 19:56:03,372 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 336 flow. Second operand 4 states and 175 transitions. [2024-10-11 19:56:03,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 117 transitions, 688 flow [2024-10-11 19:56:03,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 117 transitions, 594 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-10-11 19:56:03,375 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 291 flow [2024-10-11 19:56:03,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=291, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2024-10-11 19:56:03,375 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2024-10-11 19:56:03,376 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 291 flow [2024-10-11 19:56:03,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:03,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:03,376 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:56:03,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:56:03,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:03,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:03,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash 799389056, now seen corresponding path program 1 times [2024-10-11 19:56:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534849710] [2024-10-11 19:56:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:56:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:03,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:03,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:03,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:56:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:56:03,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:56:03,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:03,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:56:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:03,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:56:03,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534849710] [2024-10-11 19:56:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534849710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:56:03,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:56:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:56:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29216780] [2024-10-11 19:56:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:56:03,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:56:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:56:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:56:03,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:56:03,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:03,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:03,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:56:03,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:04,145 INFO L124 PetriNetUnfolderBase]: 3409/5287 cut-off events. [2024-10-11 19:56:04,146 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2024-10-11 19:56:04,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11499 conditions, 5287 events. 3409/5287 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 38940 event pairs, 3251 based on Foata normal form. 0/3384 useless extension candidates. Maximal degree in co-relation 11423. Up to 4643 conditions per place. [2024-10-11 19:56:04,185 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 52 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2024-10-11 19:56:04,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 403 flow [2024-10-11 19:56:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:56:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:56:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-10-11 19:56:04,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-10-11 19:56:04,187 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 291 flow. Second operand 4 states and 132 transitions. [2024-10-11 19:56:04,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 403 flow [2024-10-11 19:56:04,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 399 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:56:04,190 INFO L231 Difference]: Finished difference. Result has 72 places, 77 transitions, 295 flow [2024-10-11 19:56:04,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=72, PETRI_TRANSITIONS=77} [2024-10-11 19:56:04,191 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2024-10-11 19:56:04,191 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 77 transitions, 295 flow [2024-10-11 19:56:04,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:04,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:04,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:56:04,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 19:56:04,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:04,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:04,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash 799389057, now seen corresponding path program 1 times [2024-10-11 19:56:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656173421] [2024-10-11 19:56:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:56:04,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:04,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:04,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:04,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:56:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:56:04,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:56:04,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:04,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:56:04,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:04,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656173421] [2024-10-11 19:56:04,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656173421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:56:04,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:56:04,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:56:04,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478206625] [2024-10-11 19:56:04,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:56:04,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:56:04,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:56:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:56:04,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-10-11 19:56:04,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 77 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:04,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:04,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-10-11 19:56:04,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:05,121 INFO L124 PetriNetUnfolderBase]: 4233/6798 cut-off events. [2024-10-11 19:56:05,121 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2024-10-11 19:56:05,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14751 conditions, 6798 events. 4233/6798 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 53574 event pairs, 4066 based on Foata normal form. 248/4823 useless extension candidates. Maximal degree in co-relation 14673. Up to 4671 conditions per place. [2024-10-11 19:56:05,167 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 74 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2024-10-11 19:56:05,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 523 flow [2024-10-11 19:56:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:56:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:56:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-10-11 19:56:05,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-10-11 19:56:05,169 INFO L175 Difference]: Start difference. First operand has 72 places, 77 transitions, 295 flow. Second operand 4 states and 168 transitions. [2024-10-11 19:56:05,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 523 flow [2024-10-11 19:56:05,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 100 transitions, 508 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:56:05,172 INFO L231 Difference]: Finished difference. Result has 73 places, 77 transitions, 303 flow [2024-10-11 19:56:05,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=69, 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=4, PETRI_FLOW=303, PETRI_PLACES=73, PETRI_TRANSITIONS=77} [2024-10-11 19:56:05,172 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2024-10-11 19:56:05,173 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 303 flow [2024-10-11 19:56:05,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:05,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:05,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:56:05,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:56:05,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:05,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -701261992, now seen corresponding path program 1 times [2024-10-11 19:56:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322425562] [2024-10-11 19:56:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:56:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:05,378 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:05,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:56:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:56:05,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:56:05,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:05,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:56:05,501 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 19:56:05,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-11 19:56:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 19:56:05,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:56:05,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:05,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322425562] [2024-10-11 19:56:05,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322425562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:56:05,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:56:05,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:56:05,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418156228] [2024-10-11 19:56:05,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:56:05,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:56:05,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:05,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:56:05,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:56:05,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:56:05,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:05,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:05,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:56:05,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:06,040 INFO L124 PetriNetUnfolderBase]: 2880/4749 cut-off events. [2024-10-11 19:56:06,040 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2024-10-11 19:56:06,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10910 conditions, 4749 events. 2880/4749 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 36589 event pairs, 2756 based on Foata normal form. 0/3413 useless extension candidates. Maximal degree in co-relation 10831. Up to 4078 conditions per place. [2024-10-11 19:56:06,093 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 45 selfloop transitions, 11 changer transitions 0/75 dead transitions. [2024-10-11 19:56:06,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 407 flow [2024-10-11 19:56:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:56:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:56:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-10-11 19:56:06,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-10-11 19:56:06,100 INFO L175 Difference]: Start difference. First operand has 73 places, 77 transitions, 303 flow. Second operand 5 states and 154 transitions. [2024-10-11 19:56:06,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 407 flow [2024-10-11 19:56:06,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:56:06,103 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 311 flow [2024-10-11 19:56:06,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2024-10-11 19:56:06,105 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2024-10-11 19:56:06,106 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 311 flow [2024-10-11 19:56:06,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:06,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:06,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:56:06,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:56:06,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:06,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:06,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -701261991, now seen corresponding path program 1 times [2024-10-11 19:56:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999904658] [2024-10-11 19:56:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:56:06,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:06,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:06,314 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:06,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:56:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:56:06,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 19:56:06,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:06,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 19:56:06,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:56:06,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:56:06,540 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 16 treesize of output 11 [2024-10-11 19:56:06,550 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:56:06,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:56:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:06,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:56:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:07,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:07,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999904658] [2024-10-11 19:56:07,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999904658] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:56:07,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:56:07,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-11 19:56:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188341802] [2024-10-11 19:56:07,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:56:07,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:56:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:56:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:56:07,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-10-11 19:56:07,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 311 flow. Second operand has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:07,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:07,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-10-11 19:56:07,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:12,072 INFO L124 PetriNetUnfolderBase]: 5464/9051 cut-off events. [2024-10-11 19:56:12,073 INFO L125 PetriNetUnfolderBase]: For 1918/1918 co-relation queries the response was YES. [2024-10-11 19:56:12,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20651 conditions, 9051 events. 5464/9051 cut-off events. For 1918/1918 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 75083 event pairs, 5216 based on Foata normal form. 0/6996 useless extension candidates. Maximal degree in co-relation 13573. Up to 3268 conditions per place. [2024-10-11 19:56:12,139 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 95 selfloop transitions, 46 changer transitions 0/158 dead transitions. [2024-10-11 19:56:12,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 158 transitions, 956 flow [2024-10-11 19:56:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 19:56:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-11 19:56:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 421 transitions. [2024-10-11 19:56:12,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46986607142857145 [2024-10-11 19:56:12,142 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 311 flow. Second operand 14 states and 421 transitions. [2024-10-11 19:56:12,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 158 transitions, 956 flow [2024-10-11 19:56:12,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 158 transitions, 927 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:56:12,148 INFO L231 Difference]: Finished difference. Result has 91 places, 101 transitions, 615 flow [2024-10-11 19:56:12,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=615, PETRI_PLACES=91, PETRI_TRANSITIONS=101} [2024-10-11 19:56:12,149 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 25 predicate places. [2024-10-11 19:56:12,149 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 101 transitions, 615 flow [2024-10-11 19:56:12,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:12,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:12,149 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-10-11 19:56:12,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:56:12,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:12,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:12,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1864244985, now seen corresponding path program 2 times [2024-10-11 19:56:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626208595] [2024-10-11 19:56:12,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:56:12,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:12,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:12,354 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:12,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:56:12,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:56:12,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:56:12,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:56:12,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:12,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 19:56:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:12,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:56:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:13,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626208595] [2024-10-11 19:56:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626208595] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:56:13,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:56:13,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-10-11 19:56:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083633991] [2024-10-11 19:56:13,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:56:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:56:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:56:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:56:13,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:56:13,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 101 transitions, 615 flow. Second operand has 14 states, 14 states have (on average 25.571428571428573) internal successors, (358), 14 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:13,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:13,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:56:13,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:16,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:19,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:23,244 INFO L124 PetriNetUnfolderBase]: 5494/9141 cut-off events. [2024-10-11 19:56:23,244 INFO L125 PetriNetUnfolderBase]: For 4815/4815 co-relation queries the response was YES. [2024-10-11 19:56:23,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22132 conditions, 9141 events. 5494/9141 cut-off events. For 4815/4815 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 76369 event pairs, 5216 based on Foata normal form. 30/7355 useless extension candidates. Maximal degree in co-relation 16903. Up to 7801 conditions per place. [2024-10-11 19:56:23,317 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 37 selfloop transitions, 107 changer transitions 0/161 dead transitions. [2024-10-11 19:56:23,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 161 transitions, 1377 flow [2024-10-11 19:56:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 19:56:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 19:56:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 634 transitions. [2024-10-11 19:56:23,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4502840909090909 [2024-10-11 19:56:23,320 INFO L175 Difference]: Start difference. First operand has 91 places, 101 transitions, 615 flow. Second operand 22 states and 634 transitions. [2024-10-11 19:56:23,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 161 transitions, 1377 flow [2024-10-11 19:56:23,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 161 transitions, 1374 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:56:23,339 INFO L231 Difference]: Finished difference. Result has 117 places, 161 transitions, 1390 flow [2024-10-11 19:56:23,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1390, PETRI_PLACES=117, PETRI_TRANSITIONS=161} [2024-10-11 19:56:23,339 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 51 predicate places. [2024-10-11 19:56:23,340 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 161 transitions, 1390 flow [2024-10-11 19:56:23,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 25.571428571428573) internal successors, (358), 14 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:23,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:23,340 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:56:23,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:56:23,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:23,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1248772387, now seen corresponding path program 1 times [2024-10-11 19:56:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096990159] [2024-10-11 19:56:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:56:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:23,547 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:23,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:56:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:56:23,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 19:56:23,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:23,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 19:56:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:23,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:56:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:24,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096990159] [2024-10-11 19:56:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096990159] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:56:24,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:56:24,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 19:56:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676731215] [2024-10-11 19:56:24,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:56:24,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:56:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:24,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:56:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:56:24,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:56:24,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 161 transitions, 1390 flow. Second operand has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:24,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:24,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:56:24,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:27,843 INFO L124 PetriNetUnfolderBase]: 10520/17523 cut-off events. [2024-10-11 19:56:27,843 INFO L125 PetriNetUnfolderBase]: For 9593/9593 co-relation queries the response was YES. [2024-10-11 19:56:27,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41777 conditions, 17523 events. 10520/17523 cut-off events. For 9593/9593 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 157128 event pairs, 9932 based on Foata normal form. 0/15015 useless extension candidates. Maximal degree in co-relation 41534. Up to 6153 conditions per place. [2024-10-11 19:56:27,996 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 111 selfloop transitions, 100 changer transitions 0/228 dead transitions. [2024-10-11 19:56:27,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 228 transitions, 2026 flow [2024-10-11 19:56:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:56:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:56:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2024-10-11 19:56:27,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55625 [2024-10-11 19:56:27,999 INFO L175 Difference]: Start difference. First operand has 117 places, 161 transitions, 1390 flow. Second operand 10 states and 356 transitions. [2024-10-11 19:56:27,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 228 transitions, 2026 flow [2024-10-11 19:56:28,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 228 transitions, 1746 flow, removed 87 selfloop flow, removed 9 redundant places. [2024-10-11 19:56:28,030 INFO L231 Difference]: Finished difference. Result has 119 places, 161 transitions, 1323 flow [2024-10-11 19:56:28,030 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1323, PETRI_PLACES=119, PETRI_TRANSITIONS=161} [2024-10-11 19:56:28,031 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2024-10-11 19:56:28,031 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 161 transitions, 1323 flow [2024-10-11 19:56:28,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:28,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:28,031 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:56:28,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 19:56:28,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:28,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1515941555, now seen corresponding path program 2 times [2024-10-11 19:56:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920187391] [2024-10-11 19:56:28,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:56:28,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:28,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:28,235 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:28,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:56:28,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:56:28,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:56:28,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 19:56:28,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:28,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:56:28,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 19:56:28,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:56:28,412 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 16 treesize of output 11 [2024-10-11 19:56:28,425 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:56:28,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:56:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 19:56:28,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:56:28,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:28,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920187391] [2024-10-11 19:56:28,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920187391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:56:28,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:56:28,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:56:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295456939] [2024-10-11 19:56:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:56:28,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:56:28,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:28,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:56:28,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:56:28,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:56:28,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 161 transitions, 1323 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:28,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:28,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:56:28,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:30,253 INFO L124 PetriNetUnfolderBase]: 8503/14424 cut-off events. [2024-10-11 19:56:30,253 INFO L125 PetriNetUnfolderBase]: For 11779/11779 co-relation queries the response was YES. [2024-10-11 19:56:30,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33823 conditions, 14424 events. 8503/14424 cut-off events. For 11779/11779 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 128674 event pairs, 8000 based on Foata normal form. 562/13062 useless extension candidates. Maximal degree in co-relation 33592. Up to 12225 conditions per place. [2024-10-11 19:56:30,381 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 128 selfloop transitions, 12 changer transitions 0/159 dead transitions. [2024-10-11 19:56:30,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 159 transitions, 1587 flow [2024-10-11 19:56:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:56:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:56:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-10-11 19:56:30,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-10-11 19:56:30,383 INFO L175 Difference]: Start difference. First operand has 119 places, 161 transitions, 1323 flow. Second operand 4 states and 128 transitions. [2024-10-11 19:56:30,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 159 transitions, 1587 flow [2024-10-11 19:56:30,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 159 transitions, 1519 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:56:30,408 INFO L231 Difference]: Finished difference. Result has 116 places, 159 transitions, 1263 flow [2024-10-11 19:56:30,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1263, PETRI_PLACES=116, PETRI_TRANSITIONS=159} [2024-10-11 19:56:30,409 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 50 predicate places. [2024-10-11 19:56:30,409 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 159 transitions, 1263 flow [2024-10-11 19:56:30,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:30,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:30,409 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:56:30,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:56:30,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:30,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:30,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2019548919, now seen corresponding path program 2 times [2024-10-11 19:56:30,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:30,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076460509] [2024-10-11 19:56:30,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:56:30,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:30,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:30,613 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:30,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:56:30,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:56:30,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:56:30,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:56:30,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:30,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 19:56:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 19:56:30,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:56:30,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076460509] [2024-10-11 19:56:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076460509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:56:30,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:56:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:56:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606442233] [2024-10-11 19:56:30,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:56:30,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:56:30,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:56:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:56:30,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-10-11 19:56:30,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 159 transitions, 1263 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:30,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:30,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-10-11 19:56:30,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:32,012 INFO L124 PetriNetUnfolderBase]: 6995/12180 cut-off events. [2024-10-11 19:56:32,013 INFO L125 PetriNetUnfolderBase]: For 6597/6597 co-relation queries the response was YES. [2024-10-11 19:56:32,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26922 conditions, 12180 events. 6995/12180 cut-off events. For 6597/6597 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 109310 event pairs, 6532 based on Foata normal form. 378/10968 useless extension candidates. Maximal degree in co-relation 26694. Up to 10048 conditions per place. [2024-10-11 19:56:32,117 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 112 selfloop transitions, 26 changer transitions 0/157 dead transitions. [2024-10-11 19:56:32,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 157 transitions, 1523 flow [2024-10-11 19:56:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:56:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:56:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-10-11 19:56:32,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-10-11 19:56:32,119 INFO L175 Difference]: Start difference. First operand has 116 places, 159 transitions, 1263 flow. Second operand 4 states and 134 transitions. [2024-10-11 19:56:32,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 157 transitions, 1523 flow [2024-10-11 19:56:32,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 157 transitions, 1505 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:56:32,129 INFO L231 Difference]: Finished difference. Result has 113 places, 157 transitions, 1281 flow [2024-10-11 19:56:32,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1281, PETRI_PLACES=113, PETRI_TRANSITIONS=157} [2024-10-11 19:56:32,130 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 47 predicate places. [2024-10-11 19:56:32,130 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 157 transitions, 1281 flow [2024-10-11 19:56:32,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:32,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:56:32,130 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2024-10-11 19:56:32,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:56:32,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:32,333 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-10-11 19:56:32,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:56:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2019553519, now seen corresponding path program 3 times [2024-10-11 19:56:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:56:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37686073] [2024-10-11 19:56:32,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:56:32,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:56:32,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:56:32,337 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:56:32,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:56:32,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 19:56:32,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:56:32,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 19:56:32,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:56:32,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 19:56:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:32,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:56:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:56:34,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:56:34,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37686073] [2024-10-11 19:56:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37686073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:56:34,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:56:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2024-10-11 19:56:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073479746] [2024-10-11 19:56:34,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:56:34,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:56:34,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:56:34,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:56:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:56:35,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-10-11 19:56:35,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 157 transitions, 1281 flow. Second operand has 26 states, 26 states have (on average 25.76923076923077) internal successors, (670), 26 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:56:35,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:56:35,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-10-11 19:56:35,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:56:43,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:45,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:47,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:49,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:51,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:52,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:56,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:56:58,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:00,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:01,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:02,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:03,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:04,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:06,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:11,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:12,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:14,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:19,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:20,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:21,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:25,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:26,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 19:57:28,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []