./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-2_3-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_3-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:35:45,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:35:45,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:35:45,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:35:45,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:35:45,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:35:45,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:35:45,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:35:45,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:35:45,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:35:45,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:35:45,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:35:45,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:35:45,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:35:45,483 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:35:45,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:35:45,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:35:45,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:35:45,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:35:45,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:35:45,484 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:35:45,486 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:35:45,487 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:35:45,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:35:45,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:35:45,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:35:45,487 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:35:45,487 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:35:45,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:35:45,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:35:45,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:35:45,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:35:45,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:35:45,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:35:45,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:35:45,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:35:45,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:35:45,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:35:45,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:35:45,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:35:45,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:35:45,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:35:45,491 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2024-11-19 09:35:45,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:35:45,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:35:45,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:35:45,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:35:45,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:35:45,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-11-19 09:35:47,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:35:47,357 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:35:47,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-11-19 09:35:47,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752701174/cf235ab11cb7499d918189d25ee87680/FLAGd5377464b [2024-11-19 09:35:47,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/752701174/cf235ab11cb7499d918189d25ee87680 [2024-11-19 09:35:47,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:35:47,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:35:47,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:47,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:35:47,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:35:47,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:47" (1/1) ... [2024-11-19 09:35:47,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a8384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:47, skipping insertion in model container [2024-11-19 09:35:47,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:47" (1/1) ... [2024-11-19 09:35:47,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:35:47,801 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:47,816 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:47,824 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:47,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:47,851 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 09:35:47,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7366e12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:47, skipping insertion in model container [2024-11-19 09:35:47,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:47,853 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:35:47,854 INFO L158 Benchmark]: Toolchain (without parser) took 444.28ms. Allocated memory is still 213.9MB. Free memory was 146.6MB in the beginning and 123.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:35:47,854 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:35:47,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.90ms. Allocated memory is still 213.9MB. Free memory was 146.3MB in the beginning and 123.0MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:35:47,856 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 107.0MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.90ms. Allocated memory is still 213.9MB. Free memory was 146.3MB in the beginning and 123.0MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3904]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_3-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:35:49,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:35:49,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:35:49,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:35:49,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:35:49,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:35:49,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:35:49,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:35:49,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:35:49,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:35:49,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:35:49,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:35:49,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:35:49,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:35:49,886 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:35:49,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:35:49,887 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:35:49,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:35:49,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:35:49,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:35:49,891 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:35:49,892 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:35:49,892 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:35:49,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:35:49,892 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:35:49,892 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:35:49,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:35:49,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:35:49,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:35:49,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:35:49,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:35:49,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:35:49,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:35:49,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:35:49,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:35:49,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:35:49,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:35:49,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:35:49,894 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:35:49,895 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:35:49,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:35:49,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:35:49,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:35:49,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:35:49,895 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2024-11-19 09:35:50,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:35:50,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:35:50,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:35:50,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:35:50,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:35:50,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-11-19 09:35:51,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:35:51,851 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:35:51,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-11-19 09:35:51,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574f395c4/40ae6c56c3794c0fab7c5c039b91380f/FLAG9854f0d92 [2024-11-19 09:35:51,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574f395c4/40ae6c56c3794c0fab7c5c039b91380f [2024-11-19 09:35:51,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:35:51,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:35:51,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:51,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:35:51,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:35:51,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:51" (1/1) ... [2024-11-19 09:35:51,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a96ac01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:51, skipping insertion in model container [2024-11-19 09:35:51,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:51" (1/1) ... [2024-11-19 09:35:52,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:35:52,318 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:52,329 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:52,340 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:52,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:52,364 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:35:52,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:35:52,418 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:52,424 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:52,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:52,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:52,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:35:52,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:52,548 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:35:52,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52 WrapperNode [2024-11-19 09:35:52,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:52,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:35:52,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:35:52,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:35:52,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,595 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-11-19 09:35:52,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:35:52,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:35:52,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:35:52,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:35:52,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,635 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 2, 15]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 2, 8]. [2024-11-19 09:35:52,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:35:52,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:35:52,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:35:52,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:35:52,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:35:52,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:35:52,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:35:52,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:35:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:35:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:35:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:35:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-19 09:35:52,740 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:35:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:35:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:35:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:35:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:35:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:35:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:35:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:35:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:35:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:35:52,743 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:35:53,030 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:35:53,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:35:53,430 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:35:53,431 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:35:53,539 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:35:53,539 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:35:53,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:35:53 BoogieIcfgContainer [2024-11-19 09:35:53,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:35:53,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:35:53,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:35:53,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:35:53,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:35:51" (1/3) ... [2024-11-19 09:35:53,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0c4ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:35:53, skipping insertion in model container [2024-11-19 09:35:53,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52" (2/3) ... [2024-11-19 09:35:53,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0c4ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:35:53, skipping insertion in model container [2024-11-19 09:35:53,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:35:53" (3/3) ... [2024-11-19 09:35:53,548 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2024-11-19 09:35:53,561 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:35:53,561 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-19 09:35:53,561 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:35:53,619 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:35:53,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 125 transitions, 264 flow [2024-11-19 09:35:53,679 INFO L124 PetriNetUnfolderBase]: 14/158 cut-off events. [2024-11-19 09:35:53,680 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:35:53,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 158 events. 14/158 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 534 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. [2024-11-19 09:35:53,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 125 transitions, 264 flow [2024-11-19 09:35:53,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 123 transitions, 258 flow [2024-11-19 09:35:53,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:35:53,711 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;@280c2373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:35:53,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-19 09:35:53,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:35:53,716 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-19 09:35:53,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:35:53,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:53,717 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:35:53,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:35:53,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 557403, now seen corresponding path program 1 times [2024-11-19 09:35:53,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:53,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760101556] [2024-11-19 09:35:53,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:53,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:35:53,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:53,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:35:53,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:35:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:53,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:35:53,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:53,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:35:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:53,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:53,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760101556] [2024-11-19 09:35:53,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760101556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:53,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:53,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:35:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405602516] [2024-11-19 09:35:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:53,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:53,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:53,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:53,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:53,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 125 [2024-11-19 09:35:53,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:53,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:53,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 125 [2024-11-19 09:35:53,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:55,778 INFO L124 PetriNetUnfolderBase]: 7867/16174 cut-off events. [2024-11-19 09:35:55,779 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-19 09:35:55,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28480 conditions, 16174 events. 7867/16174 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 148472 event pairs, 4199 based on Foata normal form. 792/10803 useless extension candidates. Maximal degree in co-relation 28239. Up to 6584 conditions per place. [2024-11-19 09:35:55,872 INFO L140 encePairwiseOnDemand]: 109/125 looper letters, 90 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-11-19 09:35:55,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 131 transitions, 458 flow [2024-11-19 09:35:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:35:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:35:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2024-11-19 09:35:55,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6106666666666667 [2024-11-19 09:35:55,884 INFO L175 Difference]: Start difference. First operand has 119 places, 123 transitions, 258 flow. Second operand 3 states and 229 transitions. [2024-11-19 09:35:55,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 131 transitions, 458 flow [2024-11-19 09:35:55,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 131 transitions, 450 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:35:55,897 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 218 flow [2024-11-19 09:35:55,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2024-11-19 09:35:55,903 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -12 predicate places. [2024-11-19 09:35:55,903 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 218 flow [2024-11-19 09:35:55,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:55,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:55,904 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:35:55,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:35:56,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:35:56,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:35:56,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash 557404, now seen corresponding path program 1 times [2024-11-19 09:35:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:56,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242997860] [2024-11-19 09:35:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:56,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:35:56,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:56,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:35:56,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:35:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:56,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:35:56,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:56,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:35:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:56,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:56,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:56,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242997860] [2024-11-19 09:35:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242997860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:56,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:35:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492916525] [2024-11-19 09:35:56,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:56,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:56,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:56,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:56,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 125 [2024-11-19 09:35:56,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:56,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:56,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 125 [2024-11-19 09:35:56,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:57,937 INFO L124 PetriNetUnfolderBase]: 6411/13932 cut-off events. [2024-11-19 09:35:57,938 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-19 09:35:57,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24164 conditions, 13932 events. 6411/13932 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 132185 event pairs, 2743 based on Foata normal form. 1/9232 useless extension candidates. Maximal degree in co-relation 8831. Up to 5674 conditions per place. [2024-11-19 09:35:58,147 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 85 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-11-19 09:35:58,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 125 transitions, 432 flow [2024-11-19 09:35:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:35:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:35:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2024-11-19 09:35:58,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.584 [2024-11-19 09:35:58,150 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 218 flow. Second operand 3 states and 219 transitions. [2024-11-19 09:35:58,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 125 transitions, 432 flow [2024-11-19 09:35:58,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 125 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:35:58,158 INFO L231 Difference]: Finished difference. Result has 101 places, 99 transitions, 206 flow [2024-11-19 09:35:58,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2024-11-19 09:35:58,159 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -18 predicate places. [2024-11-19 09:35:58,159 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 206 flow [2024-11-19 09:35:58,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:58,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:58,160 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:35:58,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:35:58,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:35:58,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:35:58,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash 17277970, now seen corresponding path program 1 times [2024-11-19 09:35:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384088370] [2024-11-19 09:35:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:58,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:35:58,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:58,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:35:58,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:35:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:58,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:35:58,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:58,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:58,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:58,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384088370] [2024-11-19 09:35:58,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384088370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:58,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:35:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261274690] [2024-11-19 09:35:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:58,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:58,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:58,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:58,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:58,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 125 [2024-11-19 09:35:58,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:58,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:58,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 125 [2024-11-19 09:35:58,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:59,450 INFO L124 PetriNetUnfolderBase]: 6410/12532 cut-off events. [2024-11-19 09:35:59,450 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2024-11-19 09:35:59,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22764 conditions, 12532 events. 6410/12532 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 107472 event pairs, 6045 based on Foata normal form. 1/8162 useless extension candidates. Maximal degree in co-relation 8831. Up to 9455 conditions per place. [2024-11-19 09:35:59,499 INFO L140 encePairwiseOnDemand]: 122/125 looper letters, 85 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-11-19 09:35:59,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 124 transitions, 430 flow [2024-11-19 09:35:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:35:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:35:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2024-11-19 09:35:59,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5786666666666667 [2024-11-19 09:35:59,504 INFO L175 Difference]: Start difference. First operand has 101 places, 99 transitions, 206 flow. Second operand 3 states and 217 transitions. [2024-11-19 09:35:59,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 124 transitions, 430 flow [2024-11-19 09:35:59,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 124 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:35:59,510 INFO L231 Difference]: Finished difference. Result has 101 places, 98 transitions, 204 flow [2024-11-19 09:35:59,510 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=101, PETRI_TRANSITIONS=98} [2024-11-19 09:35:59,511 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -18 predicate places. [2024-11-19 09:35:59,513 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 98 transitions, 204 flow [2024-11-19 09:35:59,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:59,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:59,514 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:35:59,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 09:35:59,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:35:59,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:35:59,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1608668968, now seen corresponding path program 1 times [2024-11-19 09:35:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:59,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091834559] [2024-11-19 09:35:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:59,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:35:59,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:59,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:35:59,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:35:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:59,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:35:59,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:59,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:35:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:59,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:59,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091834559] [2024-11-19 09:35:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091834559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:59,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:59,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:35:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750119317] [2024-11-19 09:35:59,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:59,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:59,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:59,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:59,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 125 [2024-11-19 09:35:59,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 98 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:59,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:59,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 125 [2024-11-19 09:35:59,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:01,028 INFO L124 PetriNetUnfolderBase]: 7138/13103 cut-off events. [2024-11-19 09:36:01,029 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-11-19 09:36:01,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24458 conditions, 13103 events. 7138/13103 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 105252 event pairs, 6409 based on Foata normal form. 0/9201 useless extension candidates. Maximal degree in co-relation 23133. Up to 10014 conditions per place. [2024-11-19 09:36:01,099 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 86 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2024-11-19 09:36:01,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 119 transitions, 426 flow [2024-11-19 09:36:01,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2024-11-19 09:36:01,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5413333333333333 [2024-11-19 09:36:01,101 INFO L175 Difference]: Start difference. First operand has 101 places, 98 transitions, 204 flow. Second operand 3 states and 203 transitions. [2024-11-19 09:36:01,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 119 transitions, 426 flow [2024-11-19 09:36:01,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 119 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:01,112 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 198 flow [2024-11-19 09:36:01,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-11-19 09:36:01,113 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -23 predicate places. [2024-11-19 09:36:01,113 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 198 flow [2024-11-19 09:36:01,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:01,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:01,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:01,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:36:01,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:01,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:01,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1608668967, now seen corresponding path program 1 times [2024-11-19 09:36:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:01,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47814689] [2024-11-19 09:36:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:01,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:01,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:01,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:01,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:36:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:01,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:36:01,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:01,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:36:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:01,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:01,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47814689] [2024-11-19 09:36:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47814689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:01,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:01,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:01,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457105549] [2024-11-19 09:36:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:01,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:01,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:01,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:01,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 125 [2024-11-19 09:36:01,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:01,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:01,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 125 [2024-11-19 09:36:01,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:02,800 INFO L124 PetriNetUnfolderBase]: 6410/11764 cut-off events. [2024-11-19 09:36:02,800 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-11-19 09:36:02,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22012 conditions, 11764 events. 6410/11764 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 92345 event pairs, 5291 based on Foata normal form. 394/8542 useless extension candidates. Maximal degree in co-relation 19111. Up to 8270 conditions per place. [2024-11-19 09:36:02,857 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 97 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2024-11-19 09:36:02,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 126 transitions, 466 flow [2024-11-19 09:36:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-11-19 09:36:02,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5813333333333334 [2024-11-19 09:36:02,858 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 198 flow. Second operand 3 states and 218 transitions. [2024-11-19 09:36:02,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 126 transitions, 466 flow [2024-11-19 09:36:02,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 126 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:02,867 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 211 flow [2024-11-19 09:36:02,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-11-19 09:36:02,870 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -22 predicate places. [2024-11-19 09:36:02,870 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 211 flow [2024-11-19 09:36:02,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:02,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:02,871 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:02,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 09:36:03,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:03,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:03,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1751356453, now seen corresponding path program 1 times [2024-11-19 09:36:03,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:03,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003324025] [2024-11-19 09:36:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:03,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:03,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:03,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:03,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:36:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:03,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:36:03,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:03,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:03,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:03,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003324025] [2024-11-19 09:36:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003324025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484104583] [2024-11-19 09:36:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:03,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:03,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:03,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-11-19 09:36:03,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:03,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:03,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-11-19 09:36:03,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:05,294 INFO L124 PetriNetUnfolderBase]: 5360/10373 cut-off events. [2024-11-19 09:36:05,294 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-11-19 09:36:05,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19506 conditions, 10373 events. 5360/10373 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 82588 event pairs, 133 based on Foata normal form. 0/7822 useless extension candidates. Maximal degree in co-relation 14441. Up to 3335 conditions per place. [2024-11-19 09:36:05,382 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 167 selfloop transitions, 13 changer transitions 1/213 dead transitions. [2024-11-19 09:36:05,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 213 transitions, 824 flow [2024-11-19 09:36:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:36:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:36:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 540 transitions. [2024-11-19 09:36:05,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-11-19 09:36:05,385 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 211 flow. Second operand 8 states and 540 transitions. [2024-11-19 09:36:05,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 213 transitions, 824 flow [2024-11-19 09:36:05,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 213 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:36:05,410 INFO L231 Difference]: Finished difference. Result has 107 places, 103 transitions, 299 flow [2024-11-19 09:36:05,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=107, PETRI_TRANSITIONS=103} [2024-11-19 09:36:05,413 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -12 predicate places. [2024-11-19 09:36:05,413 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 299 flow [2024-11-19 09:36:05,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:05,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:05,414 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:05,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:36:05,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:05,618 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:05,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1751356454, now seen corresponding path program 1 times [2024-11-19 09:36:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:05,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374061058] [2024-11-19 09:36:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:05,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:05,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:05,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:05,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:36:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:05,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 09:36:05,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:05,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:36:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:05,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:05,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374061058] [2024-11-19 09:36:05,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374061058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135095760] [2024-11-19 09:36:05,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:05,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:05,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:06,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-11-19 09:36:06,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:06,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:06,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-11-19 09:36:06,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:06,979 INFO L124 PetriNetUnfolderBase]: 3897/7584 cut-off events. [2024-11-19 09:36:06,979 INFO L125 PetriNetUnfolderBase]: For 2753/2759 co-relation queries the response was YES. [2024-11-19 09:36:06,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15891 conditions, 7584 events. 3897/7584 cut-off events. For 2753/2759 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 55990 event pairs, 731 based on Foata normal form. 782/7131 useless extension candidates. Maximal degree in co-relation 14428. Up to 3099 conditions per place. [2024-11-19 09:36:07,009 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 149 selfloop transitions, 10 changer transitions 2/193 dead transitions. [2024-11-19 09:36:07,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 193 transitions, 821 flow [2024-11-19 09:36:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:36:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:36:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 470 transitions. [2024-11-19 09:36:07,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-11-19 09:36:07,011 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 299 flow. Second operand 7 states and 470 transitions. [2024-11-19 09:36:07,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 193 transitions, 821 flow [2024-11-19 09:36:07,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 193 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:36:07,025 INFO L231 Difference]: Finished difference. Result has 116 places, 105 transitions, 352 flow [2024-11-19 09:36:07,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2024-11-19 09:36:07,025 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2024-11-19 09:36:07,026 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 352 flow [2024-11-19 09:36:07,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:07,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:07,026 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:07,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:07,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:07,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:07,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1802651144, now seen corresponding path program 1 times [2024-11-19 09:36:07,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:07,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102297498] [2024-11-19 09:36:07,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:07,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:07,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:36:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:07,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:36:07,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:07,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-11-19 09:36:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:07,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:07,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102297498] [2024-11-19 09:36:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102297498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:07,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634351493] [2024-11-19 09:36:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:07,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:07,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:07,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-11-19 09:36:07,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:07,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:07,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-11-19 09:36:07,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:08,660 INFO L124 PetriNetUnfolderBase]: 3438/6716 cut-off events. [2024-11-19 09:36:08,660 INFO L125 PetriNetUnfolderBase]: For 4667/4667 co-relation queries the response was YES. [2024-11-19 09:36:08,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15048 conditions, 6716 events. 3438/6716 cut-off events. For 4667/4667 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 48851 event pairs, 191 based on Foata normal form. 0/5871 useless extension candidates. Maximal degree in co-relation 13724. Up to 1941 conditions per place. [2024-11-19 09:36:08,694 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 158 selfloop transitions, 17 changer transitions 0/207 dead transitions. [2024-11-19 09:36:08,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 207 transitions, 1043 flow [2024-11-19 09:36:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:36:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:36:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 522 transitions. [2024-11-19 09:36:08,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.522 [2024-11-19 09:36:08,696 INFO L175 Difference]: Start difference. First operand has 116 places, 105 transitions, 352 flow. Second operand 8 states and 522 transitions. [2024-11-19 09:36:08,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 207 transitions, 1043 flow [2024-11-19 09:36:08,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 207 transitions, 1013 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:36:08,719 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 455 flow [2024-11-19 09:36:08,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=455, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-11-19 09:36:08,720 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2024-11-19 09:36:08,720 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 455 flow [2024-11-19 09:36:08,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:08,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:08,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:08,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:36:08,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:08,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1802651145, now seen corresponding path program 1 times [2024-11-19 09:36:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897982327] [2024-11-19 09:36:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:08,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:08,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:08,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:08,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:36:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:09,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 09:36:09,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:09,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:36:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:09,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:09,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:09,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897982327] [2024-11-19 09:36:09,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897982327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:09,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:09,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:09,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397103930] [2024-11-19 09:36:09,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:09,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:09,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:09,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:09,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:09,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-11-19 09:36:09,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:09,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:09,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-11-19 09:36:09,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:10,238 INFO L124 PetriNetUnfolderBase]: 2519/5013 cut-off events. [2024-11-19 09:36:10,238 INFO L125 PetriNetUnfolderBase]: For 4918/4934 co-relation queries the response was YES. [2024-11-19 09:36:10,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12437 conditions, 5013 events. 2519/5013 cut-off events. For 4918/4934 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 34622 event pairs, 342 based on Foata normal form. 536/5407 useless extension candidates. Maximal degree in co-relation 11357. Up to 2291 conditions per place. [2024-11-19 09:36:10,263 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 143 selfloop transitions, 14 changer transitions 1/190 dead transitions. [2024-11-19 09:36:10,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 190 transitions, 1021 flow [2024-11-19 09:36:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:36:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:36:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 453 transitions. [2024-11-19 09:36:10,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177142857142857 [2024-11-19 09:36:10,265 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 455 flow. Second operand 7 states and 453 transitions. [2024-11-19 09:36:10,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 190 transitions, 1021 flow [2024-11-19 09:36:10,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 190 transitions, 1018 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:36:10,277 INFO L231 Difference]: Finished difference. Result has 130 places, 117 transitions, 526 flow [2024-11-19 09:36:10,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=526, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2024-11-19 09:36:10,278 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2024-11-19 09:36:10,278 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 526 flow [2024-11-19 09:36:10,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:10,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:10,278 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:10,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:10,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:10,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:10,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1800086855, now seen corresponding path program 1 times [2024-11-19 09:36:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611742108] [2024-11-19 09:36:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:10,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:10,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:10,488 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:10,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:36:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:10,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:36:10,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:10,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:10,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:10,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:10,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:10,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:10,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-19 09:36:10,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:36:10,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 53 [2024-11-19 09:36:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:10,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:10,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:10,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611742108] [2024-11-19 09:36:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611742108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:10,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:10,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479648969] [2024-11-19 09:36:10,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:10,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:10,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:10,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:10,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:10,934 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 125 [2024-11-19 09:36:10,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:10,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:10,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 125 [2024-11-19 09:36:10,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:11,694 INFO L124 PetriNetUnfolderBase]: 3195/5713 cut-off events. [2024-11-19 09:36:11,694 INFO L125 PetriNetUnfolderBase]: For 9379/9394 co-relation queries the response was YES. [2024-11-19 09:36:11,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15686 conditions, 5713 events. 3195/5713 cut-off events. For 9379/9394 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 36763 event pairs, 2013 based on Foata normal form. 0/5488 useless extension candidates. Maximal degree in co-relation 14391. Up to 4479 conditions per place. [2024-11-19 09:36:11,722 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 99 selfloop transitions, 10 changer transitions 0/138 dead transitions. [2024-11-19 09:36:11,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 138 transitions, 846 flow [2024-11-19 09:36:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2024-11-19 09:36:11,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.552 [2024-11-19 09:36:11,724 INFO L175 Difference]: Start difference. First operand has 130 places, 117 transitions, 526 flow. Second operand 3 states and 207 transitions. [2024-11-19 09:36:11,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 138 transitions, 846 flow [2024-11-19 09:36:11,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 819 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:36:11,735 INFO L231 Difference]: Finished difference. Result has 129 places, 125 transitions, 623 flow [2024-11-19 09:36:11,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=129, PETRI_TRANSITIONS=125} [2024-11-19 09:36:11,736 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2024-11-19 09:36:11,736 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 623 flow [2024-11-19 09:36:11,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:11,737 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:11,737 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:11,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:11,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:11,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:11,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash -31881743, now seen corresponding path program 1 times [2024-11-19 09:36:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044746322] [2024-11-19 09:36:11,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:11,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:11,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:11,940 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:11,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 09:36:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:12,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:36:12,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:12,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:12,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:12,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:12,094 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:12,095 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:12,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-19 09:36:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:12,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:12,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:12,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044746322] [2024-11-19 09:36:12,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044746322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:12,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:12,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:12,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447509235] [2024-11-19 09:36:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:12,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:12,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:12,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 125 [2024-11-19 09:36:12,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 125 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:12,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:12,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 125 [2024-11-19 09:36:12,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:13,140 INFO L124 PetriNetUnfolderBase]: 3553/6316 cut-off events. [2024-11-19 09:36:13,140 INFO L125 PetriNetUnfolderBase]: For 12246/12261 co-relation queries the response was YES. [2024-11-19 09:36:13,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19128 conditions, 6316 events. 3553/6316 cut-off events. For 12246/12261 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 40942 event pairs, 2263 based on Foata normal form. 0/6171 useless extension candidates. Maximal degree in co-relation 17758. Up to 4911 conditions per place. [2024-11-19 09:36:13,177 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 102 selfloop transitions, 17 changer transitions 0/149 dead transitions. [2024-11-19 09:36:13,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 149 transitions, 1007 flow [2024-11-19 09:36:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-11-19 09:36:13,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5546666666666666 [2024-11-19 09:36:13,179 INFO L175 Difference]: Start difference. First operand has 129 places, 125 transitions, 623 flow. Second operand 3 states and 208 transitions. [2024-11-19 09:36:13,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 149 transitions, 1007 flow [2024-11-19 09:36:13,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 149 transitions, 977 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:13,223 INFO L231 Difference]: Finished difference. Result has 131 places, 137 transitions, 795 flow [2024-11-19 09:36:13,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=131, PETRI_TRANSITIONS=137} [2024-11-19 09:36:13,223 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 12 predicate places. [2024-11-19 09:36:13,224 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 137 transitions, 795 flow [2024-11-19 09:36:13,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:13,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:13,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:13,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 09:36:13,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:13,429 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:13,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash 663373826, now seen corresponding path program 1 times [2024-11-19 09:36:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648522305] [2024-11-19 09:36:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:13,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:13,432 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:13,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:36:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:13,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:36:13,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:13,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:13,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:13,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:13,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-19 09:36:13,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:13,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:13,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:13,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:36:13,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 93 [2024-11-19 09:36:13,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:36:13,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 161 treesize of output 65 [2024-11-19 09:36:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:13,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:13,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648522305] [2024-11-19 09:36:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648522305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:13,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:13,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:36:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383742029] [2024-11-19 09:36:13,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:13,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:13,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 125 [2024-11-19 09:36:13,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 137 transitions, 795 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:13,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:13,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 125 [2024-11-19 09:36:13,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:16,241 INFO L124 PetriNetUnfolderBase]: 4175/7507 cut-off events. [2024-11-19 09:36:16,241 INFO L125 PetriNetUnfolderBase]: For 18778/18787 co-relation queries the response was YES. [2024-11-19 09:36:16,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24195 conditions, 7507 events. 4175/7507 cut-off events. For 18778/18787 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 51370 event pairs, 2412 based on Foata normal form. 242/7597 useless extension candidates. Maximal degree in co-relation 22460. Up to 5826 conditions per place. [2024-11-19 09:36:16,284 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 148 selfloop transitions, 27 changer transitions 0/204 dead transitions. [2024-11-19 09:36:16,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 204 transitions, 1495 flow [2024-11-19 09:36:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:36:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:36:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 377 transitions. [2024-11-19 09:36:16,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5026666666666667 [2024-11-19 09:36:16,286 INFO L175 Difference]: Start difference. First operand has 131 places, 137 transitions, 795 flow. Second operand 6 states and 377 transitions. [2024-11-19 09:36:16,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 204 transitions, 1495 flow [2024-11-19 09:36:16,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 204 transitions, 1461 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:16,334 INFO L231 Difference]: Finished difference. Result has 138 places, 164 transitions, 1094 flow [2024-11-19 09:36:16,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1094, PETRI_PLACES=138, PETRI_TRANSITIONS=164} [2024-11-19 09:36:16,334 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2024-11-19 09:36:16,335 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 1094 flow [2024-11-19 09:36:16,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:16,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:16,335 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:16,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:16,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:16,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:16,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:16,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1026180641, now seen corresponding path program 1 times [2024-11-19 09:36:16,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:16,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378177613] [2024-11-19 09:36:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:16,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:16,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:16,542 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:16,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:36:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:36:16,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:36:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:36:16,865 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:36:16,865 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:36:16,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-19 09:36:16,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-19 09:36:16,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-19 09:36:16,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-11-19 09:36:16,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-19 09:36:16,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-19 09:36:16,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-19 09:36:16,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-11-19 09:36:16,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (22 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-11-19 09:36:16,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-19 09:36:16,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-19 09:36:16,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-19 09:36:16,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-19 09:36:16,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-19 09:36:16,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-19 09:36:16,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-19 09:36:16,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-19 09:36:16,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-19 09:36:16,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-19 09:36:16,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 09:36:17,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:17,073 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:17,101 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:36:17,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:36:17,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:36:17 BasicIcfg [2024-11-19 09:36:17,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:36:17,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:36:17,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:36:17,105 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:36:17,106 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:35:53" (3/4) ... [2024-11-19 09:36:17,108 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:36:17,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:36:17,109 INFO L158 Benchmark]: Toolchain (without parser) took 25212.70ms. Allocated memory was 60.8MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 30.8MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-19 09:36:17,109 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 60.8MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:36:17,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.38ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 30.5MB in the beginning and 35.7MB in the end (delta: -5.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 09:36:17,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.82ms. Allocated memory is still 79.7MB. Free memory was 35.7MB in the beginning and 33.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:36:17,110 INFO L158 Benchmark]: Boogie Preprocessor took 73.16ms. Allocated memory is still 79.7MB. Free memory was 33.0MB in the beginning and 27.9MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:36:17,110 INFO L158 Benchmark]: RCFGBuilder took 866.08ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 27.9MB in the beginning and 67.3MB in the end (delta: -39.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-19 09:36:17,111 INFO L158 Benchmark]: TraceAbstraction took 23562.78ms. Allocated memory was 104.9MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 66.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-19 09:36:17,111 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 3.6GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:36:17,114 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.12ms. Allocated memory is still 60.8MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.38ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 30.5MB in the beginning and 35.7MB in the end (delta: -5.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.82ms. Allocated memory is still 79.7MB. Free memory was 35.7MB in the beginning and 33.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.16ms. Allocated memory is still 79.7MB. Free memory was 33.0MB in the beginning and 27.9MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 866.08ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 27.9MB in the beginning and 67.3MB in the end (delta: -39.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23562.78ms. Allocated memory was 104.9MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 66.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 3.6GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, d={3:24}, data={3:0}, res=0, t1=0, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, res=0, t1=0, t2=1] [L3933] 0 data->shared.a = 3 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3936] 0 data->shared.b = 3 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3939] EXPR 0 data->shared.a [L3939] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] CALL 0 reach_error() [L3883] 0 (0) ? (void) (0) : __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_3-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_3-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3961]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 132 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1467 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1189 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2930 IncrementalHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 7 mSDtfsCounter, 2930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1094occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 747 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1107 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:36:17,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample