./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:42:09,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:42:09,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:42:09,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:42:09,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:42:09,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:42:09,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:42:09,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:42:09,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:42:09,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:42:09,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:42:09,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:42:09,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:42:09,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:42:09,636 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:42:09,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:42:09,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:42:09,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:42:09,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:42:09,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:42:09,638 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:42:09,641 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:42:09,641 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:42:09,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:42:09,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:42:09,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:42:09,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:42:09,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:42:09,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:42:09,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:42:09,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:42:09,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:42:09,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:42:09,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:42:09,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:42:09,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:42:09,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:42:09,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:42:09,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:42:09,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:42:09,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:42:09,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:42:09,645 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2024-10-11 19:42:09,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:42:09,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:42:09,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:42:09,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:42:09,843 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:42:09,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-10-11 19:42:11,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:42:11,264 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:42:11,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-10-11 19:42:11,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c32481930/6519a62c14844d9685a335f4f4bc7645/FLAG097709de7 [2024-10-11 19:42:11,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c32481930/6519a62c14844d9685a335f4f4bc7645 [2024-10-11 19:42:11,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:42:11,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:42:11,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:42:11,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:42:11,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:42:11,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:42:11" (1/1) ... [2024-10-11 19:42:11,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29512681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:11, skipping insertion in model container [2024-10-11 19:42:11,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:42:11" (1/1) ... [2024-10-11 19:42:11,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:42:11,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:42:11,789 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:42:11,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3bd181fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:11, skipping insertion in model container [2024-10-11 19:42:11,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:42:11,790 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:42:11,791 INFO L158 Benchmark]: Toolchain (without parser) took 481.16ms. Allocated memory is still 136.3MB. Free memory was 63.6MB in the beginning and 86.4MB in the end (delta: -22.8MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-11 19:42:11,792 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:42:11,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.03ms. Allocated memory is still 136.3MB. Free memory was 63.3MB in the beginning and 86.4MB in the end (delta: -23.1MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-11 19:42:11,793 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 136.3MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.03ms. Allocated memory is still 136.3MB. Free memory was 63.3MB in the beginning and 86.4MB in the end (delta: -23.1MB). Peak memory consumption was 4.5MB. 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:42:13,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:42:13,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:42:13,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:42:13,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:42:13,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:42:13,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:42:13,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:42:13,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:42:13,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:42:13,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:42:13,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:42:13,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:42:13,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:42:13,446 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:42:13,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:42:13,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:42:13,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:42:13,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:42:13,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:42:13,447 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:42:13,449 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:42:13,450 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:42:13,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:42:13,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:42:13,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:42:13,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:42:13,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:42:13,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:42:13,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:42:13,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:42:13,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:42:13,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:42:13,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:42:13,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:42:13,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:42:13,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:42:13,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:42:13,452 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:42:13,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:42:13,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:42:13,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:42:13,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:42:13,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:42:13,454 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:42:13,454 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2024-10-11 19:42:13,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:42:13,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:42:13,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:42:13,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:42:13,708 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:42:13,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-10-11 19:42:14,945 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:42:15,194 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:42:15,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-10-11 19:42:15,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/786a8af5a/a3b5cf327e4b4a2bb378c46724d495af/FLAG8dacbe981 [2024-10-11 19:42:15,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/786a8af5a/a3b5cf327e4b4a2bb378c46724d495af [2024-10-11 19:42:15,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:42:15,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:42:15,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:42:15,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:42:15,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:42:15,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:42:15" (1/1) ... [2024-10-11 19:42:15,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c681b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:15, skipping insertion in model container [2024-10-11 19:42:15,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:42:15" (1/1) ... [2024-10-11 19:42:15,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:42:15,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:42:15,987 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:42:16,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:42:16,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:42:16,050 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:42:16,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:42:16,130 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:42:16,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16 WrapperNode [2024-10-11 19:42:16,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:42:16,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:42:16,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:42:16,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:42:16,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,190 INFO L138 Inliner]: procedures = 249, calls = 40, calls flagged for inlining = 11, calls inlined = 14, statements flattened = 118 [2024-10-11 19:42:16,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:42:16,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:42:16,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:42:16,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:42:16,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,237 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2024-10-11 19:42:16,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:42:16,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:42:16,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:42:16,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:42:16,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:42:16,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:42:16,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:42:16,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:42:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:42:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:42:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:42:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-11 19:42:16,355 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-11 19:42:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:42:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:42:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:42:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:42:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:42:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:42:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:42:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:42:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:42:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:42:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:42:16,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:42:16,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:42:16,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:42:16,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:42:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:42:16,361 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:42:16,589 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:42:16,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:42:16,917 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:42:16,918 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:42:17,023 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:42:17,024 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:42:17,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:42:17 BoogieIcfgContainer [2024-10-11 19:42:17,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:42:17,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:42:17,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:42:17,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:42:17,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:42:15" (1/3) ... [2024-10-11 19:42:17,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649b46a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:42:17, skipping insertion in model container [2024-10-11 19:42:17,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16" (2/3) ... [2024-10-11 19:42:17,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649b46a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:42:17, skipping insertion in model container [2024-10-11 19:42:17,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:42:17" (3/3) ... [2024-10-11 19:42:17,031 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-10-11 19:42:17,042 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:42:17,043 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-10-11 19:42:17,043 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:42:17,097 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 19:42:17,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 104 transitions, 222 flow [2024-10-11 19:42:17,173 INFO L124 PetriNetUnfolderBase]: 14/137 cut-off events. [2024-10-11 19:42:17,173 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:42:17,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 137 events. 14/137 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 435 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2024-10-11 19:42:17,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 104 transitions, 222 flow [2024-10-11 19:42:17,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 102 transitions, 216 flow [2024-10-11 19:42:17,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:42:17,194 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;@c4c877a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:42:17,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-10-11 19:42:17,198 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:42:17,198 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-11 19:42:17,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:42:17,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:17,199 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:42:17,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:17,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash 425203, now seen corresponding path program 1 times [2024-10-11 19:42:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:17,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665217960] [2024-10-11 19:42:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:17,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:17,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:17,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:17,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:42:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:17,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:42:17,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:17,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:17,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:17,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665217960] [2024-10-11 19:42:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665217960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:17,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:17,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031752085] [2024-10-11 19:42:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:17,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:17,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:17,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:17,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-10-11 19:42:17,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:17,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:17,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-10-11 19:42:17,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:18,316 INFO L124 PetriNetUnfolderBase]: 3071/7663 cut-off events. [2024-10-11 19:42:18,316 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-11 19:42:18,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12575 conditions, 7663 events. 3071/7663 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 73970 event pairs, 407 based on Foata normal form. 584/5609 useless extension candidates. Maximal degree in co-relation 12356. Up to 4146 conditions per place. [2024-10-11 19:42:18,370 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 72 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-10-11 19:42:18,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 110 transitions, 380 flow [2024-10-11 19:42:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-10-11 19:42:18,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2024-10-11 19:42:18,381 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 216 flow. Second operand 3 states and 198 transitions. [2024-10-11 19:42:18,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 110 transitions, 380 flow [2024-10-11 19:42:18,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 110 transitions, 372 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:42:18,387 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 184 flow [2024-10-11 19:42:18,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2024-10-11 19:42:18,394 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -8 predicate places. [2024-10-11 19:42:18,394 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 184 flow [2024-10-11 19:42:18,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:18,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:18,395 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:42:18,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:42:18,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:18,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:18,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash 425204, now seen corresponding path program 1 times [2024-10-11 19:42:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:18,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539832872] [2024-10-11 19:42:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:18,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:18,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:18,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:18,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:42:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:18,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:42:18,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:18,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:18,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:18,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539832872] [2024-10-11 19:42:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539832872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:18,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:18,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824573746] [2024-10-11 19:42:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:18,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:18,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:18,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-10-11 19:42:18,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:18,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:18,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-10-11 19:42:18,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:19,411 INFO L124 PetriNetUnfolderBase]: 3071/7661 cut-off events. [2024-10-11 19:42:19,412 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-10-11 19:42:19,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12691 conditions, 7661 events. 3071/7661 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 73799 event pairs, 407 based on Foata normal form. 1/5024 useless extension candidates. Maximal degree in co-relation 1458. Up to 4146 conditions per place. [2024-10-11 19:42:19,458 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 71 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2024-10-11 19:42:19,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 370 flow [2024-10-11 19:42:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2024-10-11 19:42:19,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-10-11 19:42:19,462 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 184 flow. Second operand 3 states and 192 transitions. [2024-10-11 19:42:19,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 370 flow [2024-10-11 19:42:19,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 108 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:19,467 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 180 flow [2024-10-11 19:42:19,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2024-10-11 19:42:19,468 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -10 predicate places. [2024-10-11 19:42:19,468 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 180 flow [2024-10-11 19:42:19,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:19,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:19,470 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-11 19:42:19,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:42:19,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:19,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:19,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 13181125, now seen corresponding path program 1 times [2024-10-11 19:42:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940473309] [2024-10-11 19:42:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:19,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:19,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:19,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:42:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:19,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:42:19,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:19,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:19,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:19,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940473309] [2024-10-11 19:42:19,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940473309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:19,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:19,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:19,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507238800] [2024-10-11 19:42:19,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:19,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:19,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:19,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:19,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 104 [2024-10-11 19:42:19,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:19,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:19,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 104 [2024-10-11 19:42:19,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:20,213 INFO L124 PetriNetUnfolderBase]: 3070/6028 cut-off events. [2024-10-11 19:42:20,213 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-10-11 19:42:20,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11058 conditions, 6028 events. 3070/6028 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 45283 event pairs, 2805 based on Foata normal form. 1/4099 useless extension candidates. Maximal degree in co-relation 3361. Up to 4459 conditions per place. [2024-10-11 19:42:20,234 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 71 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-10-11 19:42:20,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 107 transitions, 368 flow [2024-10-11 19:42:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-10-11 19:42:20,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2024-10-11 19:42:20,238 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 180 flow. Second operand 3 states and 194 transitions. [2024-10-11 19:42:20,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 107 transitions, 368 flow [2024-10-11 19:42:20,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 107 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:20,241 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 178 flow [2024-10-11 19:42:20,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-10-11 19:42:20,242 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -10 predicate places. [2024-10-11 19:42:20,243 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 178 flow [2024-10-11 19:42:20,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:20,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:20,243 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:20,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:20,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:20,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:20,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1612670941, now seen corresponding path program 1 times [2024-10-11 19:42:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169246491] [2024-10-11 19:42:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:20,448 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:20,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:42:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:20,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:42:20,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:20,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:20,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:20,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:20,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169246491] [2024-10-11 19:42:20,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169246491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:20,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:20,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897642628] [2024-10-11 19:42:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:20,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:20,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-10-11 19:42:20,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:20,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:20,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-10-11 19:42:20,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:21,488 INFO L124 PetriNetUnfolderBase]: 2554/6238 cut-off events. [2024-10-11 19:42:21,489 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2024-10-11 19:42:21,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10599 conditions, 6238 events. 2554/6238 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 56428 event pairs, 47 based on Foata normal form. 0/4242 useless extension candidates. Maximal degree in co-relation 9162. Up to 2287 conditions per place. [2024-10-11 19:42:21,514 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 135 selfloop transitions, 13 changer transitions 1/183 dead transitions. [2024-10-11 19:42:21,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 183 transitions, 675 flow [2024-10-11 19:42:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:42:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:42:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 485 transitions. [2024-10-11 19:42:21,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5829326923076923 [2024-10-11 19:42:21,517 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 178 flow. Second operand 8 states and 485 transitions. [2024-10-11 19:42:21,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 183 transitions, 675 flow [2024-10-11 19:42:21,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 183 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:21,531 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 261 flow [2024-10-11 19:42:21,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-10-11 19:42:21,533 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -1 predicate places. [2024-10-11 19:42:21,533 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 261 flow [2024-10-11 19:42:21,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:21,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:21,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:21,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:21,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:21,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:21,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1612670942, now seen corresponding path program 1 times [2024-10-11 19:42:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:21,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129973449] [2024-10-11 19:42:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:21,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:21,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:21,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:42:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:21,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 19:42:21,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:21,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:21,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:21,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:21,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129973449] [2024-10-11 19:42:21,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129973449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:21,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:21,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071666373] [2024-10-11 19:42:21,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:21,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:21,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:21,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:21,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:22,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-10-11 19:42:22,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:22,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:22,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-10-11 19:42:22,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:22,764 INFO L124 PetriNetUnfolderBase]: 1721/4271 cut-off events. [2024-10-11 19:42:22,765 INFO L125 PetriNetUnfolderBase]: For 1432/1432 co-relation queries the response was YES. [2024-10-11 19:42:22,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8298 conditions, 4271 events. 1721/4271 cut-off events. For 1432/1432 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 36382 event pairs, 95 based on Foata normal form. 450/3721 useless extension candidates. Maximal degree in co-relation 7164. Up to 1957 conditions per place. [2024-10-11 19:42:22,778 INFO L140 encePairwiseOnDemand]: 96/104 looper letters, 120 selfloop transitions, 10 changer transitions 2/166 dead transitions. [2024-10-11 19:42:22,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 166 transitions, 685 flow [2024-10-11 19:42:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:42:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:42:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 421 transitions. [2024-10-11 19:42:22,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5782967032967034 [2024-10-11 19:42:22,780 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 261 flow. Second operand 7 states and 421 transitions. [2024-10-11 19:42:22,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 166 transitions, 685 flow [2024-10-11 19:42:22,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 166 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:42:22,785 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 312 flow [2024-10-11 19:42:22,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2024-10-11 19:42:22,785 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2024-10-11 19:42:22,786 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 312 flow [2024-10-11 19:42:22,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:22,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:22,786 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:22,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:22,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:22,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1549885201, now seen corresponding path program 1 times [2024-10-11 19:42:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317517473] [2024-10-11 19:42:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:22,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:22,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:22,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:22,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:42:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:23,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:42:23,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:23,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:23,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:23,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317517473] [2024-10-11 19:42:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317517473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66897851] [2024-10-11 19:42:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:23,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:23,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 104 [2024-10-11 19:42:23,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:23,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:23,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 104 [2024-10-11 19:42:23,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:23,527 INFO L124 PetriNetUnfolderBase]: 1973/3899 cut-off events. [2024-10-11 19:42:23,527 INFO L125 PetriNetUnfolderBase]: For 3268/3268 co-relation queries the response was YES. [2024-10-11 19:42:23,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9077 conditions, 3899 events. 1973/3899 cut-off events. For 3268/3268 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 26642 event pairs, 1470 based on Foata normal form. 0/3246 useless extension candidates. Maximal degree in co-relation 7939. Up to 2462 conditions per place. [2024-10-11 19:42:23,539 INFO L140 encePairwiseOnDemand]: 95/104 looper letters, 73 selfloop transitions, 6 changer transitions 0/105 dead transitions. [2024-10-11 19:42:23,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 105 transitions, 492 flow [2024-10-11 19:42:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2024-10-11 19:42:23,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2024-10-11 19:42:23,540 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 312 flow. Second operand 3 states and 174 transitions. [2024-10-11 19:42:23,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 105 transitions, 492 flow [2024-10-11 19:42:23,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 475 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 19:42:23,544 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 297 flow [2024-10-11 19:42:23,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2024-10-11 19:42:23,544 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2024-10-11 19:42:23,545 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 297 flow [2024-10-11 19:42:23,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:23,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:23,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:23,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:23,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:23,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:23,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1549885200, now seen corresponding path program 1 times [2024-10-11 19:42:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:23,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085772082] [2024-10-11 19:42:23,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:23,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:23,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:23,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:23,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:42:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:23,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:42:23,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:23,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:23,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:23,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085772082] [2024-10-11 19:42:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085772082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:23,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:23,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078880721] [2024-10-11 19:42:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:23,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:23,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 104 [2024-10-11 19:42:23,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:23,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:23,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 104 [2024-10-11 19:42:23,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:24,269 INFO L124 PetriNetUnfolderBase]: 1721/3468 cut-off events. [2024-10-11 19:42:24,269 INFO L125 PetriNetUnfolderBase]: For 2284/2284 co-relation queries the response was YES. [2024-10-11 19:42:24,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8092 conditions, 3468 events. 1721/3468 cut-off events. For 2284/2284 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 23713 event pairs, 1073 based on Foata normal form. 146/3011 useless extension candidates. Maximal degree in co-relation 6954. Up to 1744 conditions per place. [2024-10-11 19:42:24,281 INFO L140 encePairwiseOnDemand]: 97/104 looper letters, 84 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2024-10-11 19:42:24,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 113 transitions, 531 flow [2024-10-11 19:42:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2024-10-11 19:42:24,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-10-11 19:42:24,283 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 297 flow. Second operand 3 states and 189 transitions. [2024-10-11 19:42:24,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 113 transitions, 531 flow [2024-10-11 19:42:24,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 113 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:24,288 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 317 flow [2024-10-11 19:42:24,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2024-10-11 19:42:24,288 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2024-10-11 19:42:24,288 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 317 flow [2024-10-11 19:42:24,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:24,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:24,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:24,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:24,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:24,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:24,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash -707364456, now seen corresponding path program 1 times [2024-10-11 19:42:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855751008] [2024-10-11 19:42:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:24,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:24,493 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:24,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:42:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:24,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 19:42:24,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:24,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:24,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:24,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:24,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855751008] [2024-10-11 19:42:24,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855751008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:24,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:24,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:24,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942757353] [2024-10-11 19:42:24,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:24,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:24,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:24,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:24,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:24,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-10-11 19:42:24,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:24,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:24,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-10-11 19:42:24,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:25,352 INFO L124 PetriNetUnfolderBase]: 1301/2846 cut-off events. [2024-10-11 19:42:25,352 INFO L125 PetriNetUnfolderBase]: For 1702/1702 co-relation queries the response was YES. [2024-10-11 19:42:25,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 2846 events. 1301/2846 cut-off events. For 1702/1702 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 19557 event pairs, 83 based on Foata normal form. 0/2525 useless extension candidates. Maximal degree in co-relation 5720. Up to 1488 conditions per place. [2024-10-11 19:42:25,362 INFO L140 encePairwiseOnDemand]: 96/104 looper letters, 116 selfloop transitions, 13 changer transitions 1/159 dead transitions. [2024-10-11 19:42:25,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 820 flow [2024-10-11 19:42:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:42:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:42:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 408 transitions. [2024-10-11 19:42:25,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5604395604395604 [2024-10-11 19:42:25,364 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 317 flow. Second operand 7 states and 408 transitions. [2024-10-11 19:42:25,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 159 transitions, 820 flow [2024-10-11 19:42:25,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 159 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:42:25,369 INFO L231 Difference]: Finished difference. Result has 106 places, 98 transitions, 390 flow [2024-10-11 19:42:25,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=390, PETRI_PLACES=106, PETRI_TRANSITIONS=98} [2024-10-11 19:42:25,370 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2024-10-11 19:42:25,370 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 98 transitions, 390 flow [2024-10-11 19:42:25,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:25,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:25,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:25,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:25,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:25,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash -707364457, now seen corresponding path program 1 times [2024-10-11 19:42:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908564095] [2024-10-11 19:42:25,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:25,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:25,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:25,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:25,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:42:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:25,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:42:25,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:25,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:25,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:25,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908564095] [2024-10-11 19:42:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908564095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525612768] [2024-10-11 19:42:25,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:25,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:25,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:25,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-10-11 19:42:25,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 98 transitions, 390 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:25,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:25,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-10-11 19:42:25,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:26,290 INFO L124 PetriNetUnfolderBase]: 1070/2320 cut-off events. [2024-10-11 19:42:26,291 INFO L125 PetriNetUnfolderBase]: For 2087/2087 co-relation queries the response was YES. [2024-10-11 19:42:26,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 2320 events. 1070/2320 cut-off events. For 2087/2087 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15342 event pairs, 143 based on Foata normal form. 0/2230 useless extension candidates. Maximal degree in co-relation 4936. Up to 794 conditions per place. [2024-10-11 19:42:26,297 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 117 selfloop transitions, 18 changer transitions 0/164 dead transitions. [2024-10-11 19:42:26,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 164 transitions, 900 flow [2024-10-11 19:42:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:42:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:42:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 457 transitions. [2024-10-11 19:42:26,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5492788461538461 [2024-10-11 19:42:26,298 INFO L175 Difference]: Start difference. First operand has 106 places, 98 transitions, 390 flow. Second operand 8 states and 457 transitions. [2024-10-11 19:42:26,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 164 transitions, 900 flow [2024-10-11 19:42:26,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 164 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:42:26,302 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 502 flow [2024-10-11 19:42:26,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=502, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2024-10-11 19:42:26,303 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 19 predicate places. [2024-10-11 19:42:26,303 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 502 flow [2024-10-11 19:42:26,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:26,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:26,304 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:26,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:42:26,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:26,504 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:26,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1606105385, now seen corresponding path program 1 times [2024-10-11 19:42:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:26,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979255839] [2024-10-11 19:42:26,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:26,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:26,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:26,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:42:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:26,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 19:42:26,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:26,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:26,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:26,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:26,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:42:26,760 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:42:26,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:42:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:26,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:26,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979255839] [2024-10-11 19:42:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979255839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:42:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249890761] [2024-10-11 19:42:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:26,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:42:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:26,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:42:26,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:42:27,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-10-11 19:42:27,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:27,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:27,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-10-11 19:42:27,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:27,641 INFO L124 PetriNetUnfolderBase]: 1229/2612 cut-off events. [2024-10-11 19:42:27,641 INFO L125 PetriNetUnfolderBase]: For 4446/4446 co-relation queries the response was YES. [2024-10-11 19:42:27,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7501 conditions, 2612 events. 1229/2612 cut-off events. For 4446/4446 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17880 event pairs, 296 based on Foata normal form. 27/2627 useless extension candidates. Maximal degree in co-relation 6541. Up to 745 conditions per place. [2024-10-11 19:42:27,651 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 131 selfloop transitions, 18 changer transitions 0/178 dead transitions. [2024-10-11 19:42:27,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 178 transitions, 1089 flow [2024-10-11 19:42:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:42:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:42:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 506 transitions. [2024-10-11 19:42:27,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405982905982906 [2024-10-11 19:42:27,653 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 502 flow. Second operand 9 states and 506 transitions. [2024-10-11 19:42:27,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 178 transitions, 1089 flow [2024-10-11 19:42:27,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 178 transitions, 1055 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 19:42:27,659 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 510 flow [2024-10-11 19:42:27,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2024-10-11 19:42:27,659 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 19 predicate places. [2024-10-11 19:42:27,660 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 510 flow [2024-10-11 19:42:27,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:27,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:27,660 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:27,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:27,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:27,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:27,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:27,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1986062419, now seen corresponding path program 1 times [2024-10-11 19:42:27,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:27,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289471032] [2024-10-11 19:42:27,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:27,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:27,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:27,863 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:27,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:42:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:27,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 19:42:27,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:27,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:27,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:28,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:28,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:42:28,106 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:42:28,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:42:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:28,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:28,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289471032] [2024-10-11 19:42:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289471032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:28,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:42:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441996929] [2024-10-11 19:42:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:28,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:42:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:42:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:42:28,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-10-11 19:42:28,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:28,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:28,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-10-11 19:42:28,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:29,090 INFO L124 PetriNetUnfolderBase]: 1476/3057 cut-off events. [2024-10-11 19:42:29,090 INFO L125 PetriNetUnfolderBase]: For 5155/5155 co-relation queries the response was YES. [2024-10-11 19:42:29,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9181 conditions, 3057 events. 1476/3057 cut-off events. For 5155/5155 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21688 event pairs, 488 based on Foata normal form. 24/3072 useless extension candidates. Maximal degree in co-relation 6600. Up to 701 conditions per place. [2024-10-11 19:42:29,103 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 133 selfloop transitions, 18 changer transitions 0/180 dead transitions. [2024-10-11 19:42:29,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 180 transitions, 1130 flow [2024-10-11 19:42:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:42:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:42:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 505 transitions. [2024-10-11 19:42:29,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5395299145299145 [2024-10-11 19:42:29,104 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 510 flow. Second operand 9 states and 505 transitions. [2024-10-11 19:42:29,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 180 transitions, 1130 flow [2024-10-11 19:42:29,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 180 transitions, 1086 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 19:42:29,113 INFO L231 Difference]: Finished difference. Result has 115 places, 100 transitions, 506 flow [2024-10-11 19:42:29,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=115, PETRI_TRANSITIONS=100} [2024-10-11 19:42:29,114 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 17 predicate places. [2024-10-11 19:42:29,114 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 100 transitions, 506 flow [2024-10-11 19:42:29,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:29,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:29,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:29,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:42:29,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:29,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:29,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1524540013, now seen corresponding path program 1 times [2024-10-11 19:42:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:29,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331412922] [2024-10-11 19:42:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:29,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:29,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:29,321 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:29,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:42:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:29,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:42:29,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:29,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:29,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:29,453 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:29,455 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-10-11 19:42:29,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:29,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:29,485 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:29,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:29,494 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-10-11 19:42:29,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:29,580 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-10-11 19:42:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:29,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:29,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331412922] [2024-10-11 19:42:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331412922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:29,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:29,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:42:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56369139] [2024-10-11 19:42:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:29,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:29,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:29,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:29,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-10-11 19:42:29,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 506 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:29,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:29,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-10-11 19:42:29,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:31,506 INFO L124 PetriNetUnfolderBase]: 1944/3749 cut-off events. [2024-10-11 19:42:31,506 INFO L125 PetriNetUnfolderBase]: For 8077/8077 co-relation queries the response was YES. [2024-10-11 19:42:31,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11843 conditions, 3749 events. 1944/3749 cut-off events. For 8077/8077 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26355 event pairs, 1162 based on Foata normal form. 140/3873 useless extension candidates. Maximal degree in co-relation 8868. Up to 2848 conditions per place. [2024-10-11 19:42:31,520 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 98 selfloop transitions, 27 changer transitions 0/151 dead transitions. [2024-10-11 19:42:31,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 151 transitions, 1036 flow [2024-10-11 19:42:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:42:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:42:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 327 transitions. [2024-10-11 19:42:31,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5240384615384616 [2024-10-11 19:42:31,522 INFO L175 Difference]: Start difference. First operand has 115 places, 100 transitions, 506 flow. Second operand 6 states and 327 transitions. [2024-10-11 19:42:31,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 151 transitions, 1036 flow [2024-10-11 19:42:31,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 151 transitions, 993 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 19:42:31,533 INFO L231 Difference]: Finished difference. Result has 118 places, 127 transitions, 766 flow [2024-10-11 19:42:31,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=118, PETRI_TRANSITIONS=127} [2024-10-11 19:42:31,533 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 20 predicate places. [2024-10-11 19:42:31,533 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 127 transitions, 766 flow [2024-10-11 19:42:31,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:31,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:31,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:31,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:42:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:31,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1705197008, now seen corresponding path program 1 times [2024-10-11 19:42:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:31,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088148190] [2024-10-11 19:42:31,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:31,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:31,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:31,736 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:31,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:42:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:31,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:42:31,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:31,955 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_85| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_85| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_85|)))) is different from true [2024-10-11 19:42:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:31,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:31,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088148190] [2024-10-11 19:42:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088148190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:31,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:31,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:42:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10289063] [2024-10-11 19:42:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:31,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:31,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:31,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-11 19:42:32,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 104 [2024-10-11 19:42:32,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 127 transitions, 766 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:32,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:32,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 104 [2024-10-11 19:42:32,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:32,645 INFO L124 PetriNetUnfolderBase]: 1965/3750 cut-off events. [2024-10-11 19:42:32,645 INFO L125 PetriNetUnfolderBase]: For 8606/8606 co-relation queries the response was YES. [2024-10-11 19:42:32,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13326 conditions, 3750 events. 1965/3750 cut-off events. For 8606/8606 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25739 event pairs, 775 based on Foata normal form. 0/3737 useless extension candidates. Maximal degree in co-relation 11493. Up to 1607 conditions per place. [2024-10-11 19:42:32,658 INFO L140 encePairwiseOnDemand]: 82/104 looper letters, 112 selfloop transitions, 33 changer transitions 4/165 dead transitions. [2024-10-11 19:42:32,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 165 transitions, 1272 flow [2024-10-11 19:42:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:42:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:42:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2024-10-11 19:42:32,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2024-10-11 19:42:32,660 INFO L175 Difference]: Start difference. First operand has 118 places, 127 transitions, 766 flow. Second operand 5 states and 210 transitions. [2024-10-11 19:42:32,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 165 transitions, 1272 flow [2024-10-11 19:42:32,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 165 transitions, 1272 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:42:32,677 INFO L231 Difference]: Finished difference. Result has 125 places, 141 transitions, 1019 flow [2024-10-11 19:42:32,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1019, PETRI_PLACES=125, PETRI_TRANSITIONS=141} [2024-10-11 19:42:32,678 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 27 predicate places. [2024-10-11 19:42:32,678 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 1019 flow [2024-10-11 19:42:32,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:32,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:32,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:32,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:42:32,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:32,878 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:32,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1414043803, now seen corresponding path program 1 times [2024-10-11 19:42:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162587155] [2024-10-11 19:42:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:32,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:32,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:32,880 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:32,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:42:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:32,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:42:32,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:32,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:33,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:33,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162587155] [2024-10-11 19:42:33,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162587155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:33,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:33,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:33,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096180862] [2024-10-11 19:42:33,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:33,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:33,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:33,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:33,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:33,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-10-11 19:42:33,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 1019 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:33,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:33,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-10-11 19:42:33,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:33,466 INFO L124 PetriNetUnfolderBase]: 1872/3619 cut-off events. [2024-10-11 19:42:33,466 INFO L125 PetriNetUnfolderBase]: For 13296/13410 co-relation queries the response was YES. [2024-10-11 19:42:33,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14870 conditions, 3619 events. 1872/3619 cut-off events. For 13296/13410 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25185 event pairs, 952 based on Foata normal form. 1/3595 useless extension candidates. Maximal degree in co-relation 12954. Up to 3088 conditions per place. [2024-10-11 19:42:33,482 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 114 selfloop transitions, 5 changer transitions 0/147 dead transitions. [2024-10-11 19:42:33,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 147 transitions, 1293 flow [2024-10-11 19:42:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2024-10-11 19:42:33,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2024-10-11 19:42:33,484 INFO L175 Difference]: Start difference. First operand has 125 places, 141 transitions, 1019 flow. Second operand 3 states and 173 transitions. [2024-10-11 19:42:33,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 147 transitions, 1293 flow [2024-10-11 19:42:33,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 147 transitions, 1216 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-10-11 19:42:33,508 INFO L231 Difference]: Finished difference. Result has 121 places, 139 transitions, 948 flow [2024-10-11 19:42:33,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=121, PETRI_TRANSITIONS=139} [2024-10-11 19:42:33,508 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 23 predicate places. [2024-10-11 19:42:33,509 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 139 transitions, 948 flow [2024-10-11 19:42:33,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:33,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:33,509 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:33,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 19:42:33,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:33,709 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:33,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:33,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1414043802, now seen corresponding path program 1 times [2024-10-11 19:42:33,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:33,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644451264] [2024-10-11 19:42:33,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:33,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:33,711 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:33,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:42:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:33,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:42:33,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:33,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:33,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:33,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:33,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644451264] [2024-10-11 19:42:33,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644451264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:33,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:33,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:33,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146879105] [2024-10-11 19:42:33,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:33,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:33,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:33,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-10-11 19:42:33,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 139 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:33,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:33,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-10-11 19:42:33,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:34,288 INFO L124 PetriNetUnfolderBase]: 1872/3612 cut-off events. [2024-10-11 19:42:34,288 INFO L125 PetriNetUnfolderBase]: For 11941/12073 co-relation queries the response was YES. [2024-10-11 19:42:34,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14621 conditions, 3612 events. 1872/3612 cut-off events. For 11941/12073 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24854 event pairs, 967 based on Foata normal form. 7/3594 useless extension candidates. Maximal degree in co-relation 14056. Up to 3088 conditions per place. [2024-10-11 19:42:34,306 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 114 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2024-10-11 19:42:34,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 145 transitions, 1222 flow [2024-10-11 19:42:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2024-10-11 19:42:34,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2024-10-11 19:42:34,307 INFO L175 Difference]: Start difference. First operand has 121 places, 139 transitions, 948 flow. Second operand 3 states and 173 transitions. [2024-10-11 19:42:34,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 145 transitions, 1222 flow [2024-10-11 19:42:34,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 145 transitions, 1212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:34,327 INFO L231 Difference]: Finished difference. Result has 119 places, 137 transitions, 944 flow [2024-10-11 19:42:34,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=944, PETRI_PLACES=119, PETRI_TRANSITIONS=137} [2024-10-11 19:42:34,328 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 21 predicate places. [2024-10-11 19:42:34,328 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 137 transitions, 944 flow [2024-10-11 19:42:34,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:34,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:34,328 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:34,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:34,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:34,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:34,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:34,529 INFO L85 PathProgramCache]: Analyzing trace with hash -614483816, now seen corresponding path program 1 times [2024-10-11 19:42:34,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:34,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333517574] [2024-10-11 19:42:34,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:34,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:34,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:34,530 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:34,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:42:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:34,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:42:34,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:34,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:34,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:34,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333517574] [2024-10-11 19:42:34,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333517574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:34,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:34,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400232365] [2024-10-11 19:42:34,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:34,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:42:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:34,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:42:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:42:34,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 104 [2024-10-11 19:42:34,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 137 transitions, 944 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:34,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:34,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 104 [2024-10-11 19:42:34,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:34,870 INFO L124 PetriNetUnfolderBase]: 225/430 cut-off events. [2024-10-11 19:42:34,870 INFO L125 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2024-10-11 19:42:34,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 430 events. 225/430 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1458 event pairs, 35 based on Foata normal form. 36/465 useless extension candidates. Maximal degree in co-relation 1606. Up to 226 conditions per place. [2024-10-11 19:42:34,871 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 57 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-10-11 19:42:34,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 83 transitions, 527 flow [2024-10-11 19:42:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:42:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:42:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2024-10-11 19:42:34,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2024-10-11 19:42:34,872 INFO L175 Difference]: Start difference. First operand has 119 places, 137 transitions, 944 flow. Second operand 4 states and 216 transitions. [2024-10-11 19:42:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 83 transitions, 527 flow [2024-10-11 19:42:34,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 83 transitions, 378 flow, removed 26 selfloop flow, removed 26 redundant places. [2024-10-11 19:42:34,875 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 202 flow [2024-10-11 19:42:34,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-10-11 19:42:34,875 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -21 predicate places. [2024-10-11 19:42:34,875 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 202 flow [2024-10-11 19:42:34,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:34,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:34,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:34,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:35,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:35,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:35,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash -324214618, now seen corresponding path program 1 times [2024-10-11 19:42:35,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:35,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866925473] [2024-10-11 19:42:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:35,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:35,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:35,079 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:35,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:42:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:35,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 19:42:35,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:35,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:35,372 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 19:42:35,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 19:42:35,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-11 19:42:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:35,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:35,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:35,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866925473] [2024-10-11 19:42:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866925473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:42:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953891021] [2024-10-11 19:42:35,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:35,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:42:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:35,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:42:35,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:42:35,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 104 [2024-10-11 19:42:35,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:35,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:35,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 104 [2024-10-11 19:42:35,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:35,769 INFO L124 PetriNetUnfolderBase]: 225/429 cut-off events. [2024-10-11 19:42:35,770 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2024-10-11 19:42:35,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 429 events. 225/429 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1397 event pairs, 95 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 1228. Up to 179 conditions per place. [2024-10-11 19:42:35,771 INFO L140 encePairwiseOnDemand]: 97/104 looper letters, 51 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2024-10-11 19:42:35,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 382 flow [2024-10-11 19:42:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:42:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:42:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-10-11 19:42:35,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2024-10-11 19:42:35,772 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 202 flow. Second operand 6 states and 244 transitions. [2024-10-11 19:42:35,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 382 flow [2024-10-11 19:42:35,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 80 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:42:35,774 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 212 flow [2024-10-11 19:42:35,774 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2024-10-11 19:42:35,774 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -20 predicate places. [2024-10-11 19:42:35,774 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 212 flow [2024-10-11 19:42:35,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:35,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:35,774 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:35,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 19:42:35,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:35,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:35,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash -384005253, now seen corresponding path program 1 times [2024-10-11 19:42:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483931472] [2024-10-11 19:42:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:35,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:35,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:35,982 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:35,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:42:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:36,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:42:36,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:36,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:36,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:36,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:36,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:42:36,346 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:42:36,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:42:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:36,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:36,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483931472] [2024-10-11 19:42:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483931472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:36,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:36,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:42:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128724972] [2024-10-11 19:42:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:36,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:42:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:36,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:42:36,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:42:36,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 104 [2024-10-11 19:42:36,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:36,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:36,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 104 [2024-10-11 19:42:36,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:36,554 INFO L124 PetriNetUnfolderBase]: 225/423 cut-off events. [2024-10-11 19:42:36,555 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2024-10-11 19:42:36,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 423 events. 225/423 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1360 event pairs, 199 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1225. Up to 409 conditions per place. [2024-10-11 19:42:36,556 INFO L140 encePairwiseOnDemand]: 94/104 looper letters, 43 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2024-10-11 19:42:36,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 58 transitions, 294 flow [2024-10-11 19:42:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:42:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:42:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2024-10-11 19:42:36,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3629807692307692 [2024-10-11 19:42:36,558 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 212 flow. Second operand 4 states and 151 transitions. [2024-10-11 19:42:36,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 58 transitions, 294 flow [2024-10-11 19:42:36,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 58 transitions, 270 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 19:42:36,559 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 184 flow [2024-10-11 19:42:36,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-10-11 19:42:36,560 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -28 predicate places. [2024-10-11 19:42:36,560 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 184 flow [2024-10-11 19:42:36,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:36,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:36,560 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:36,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-11 19:42:36,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:36,761 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:36,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 660361786, now seen corresponding path program 1 times [2024-10-11 19:42:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:36,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888923283] [2024-10-11 19:42:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:36,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:36,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:36,763 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:36,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 19:42:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:36,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 19:42:36,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:37,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:37,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:37,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:37,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:37,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:37,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-11 19:42:37,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-10-11 19:42:37,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:37,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-10-11 19:42:37,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:37,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 51 [2024-10-11 19:42:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:38,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:38,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:38,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888923283] [2024-10-11 19:42:38,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888923283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:38,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:38,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 19:42:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483564776] [2024-10-11 19:42:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:38,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:42:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:42:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:42:39,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-10-11 19:42:39,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 184 flow. Second operand has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:39,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:39,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-10-11 19:42:39,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:44,745 INFO L124 PetriNetUnfolderBase]: 513/966 cut-off events. [2024-10-11 19:42:44,745 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2024-10-11 19:42:44,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 966 events. 513/966 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4449 event pairs, 13 based on Foata normal form. 2/968 useless extension candidates. Maximal degree in co-relation 2599. Up to 256 conditions per place. [2024-10-11 19:42:44,748 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 121 selfloop transitions, 40 changer transitions 0/172 dead transitions. [2024-10-11 19:42:44,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 172 transitions, 889 flow [2024-10-11 19:42:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 19:42:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-11 19:42:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 814 transitions. [2024-10-11 19:42:44,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4604072398190045 [2024-10-11 19:42:44,750 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 184 flow. Second operand 17 states and 814 transitions. [2024-10-11 19:42:44,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 172 transitions, 889 flow [2024-10-11 19:42:44,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 172 transitions, 871 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:42:44,752 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 481 flow [2024-10-11 19:42:44,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=481, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2024-10-11 19:42:44,753 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2024-10-11 19:42:44,753 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 481 flow [2024-10-11 19:42:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:44,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:44,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:44,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 19:42:44,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:44,954 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:44,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1737643324, now seen corresponding path program 2 times [2024-10-11 19:42:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068498930] [2024-10-11 19:42:44,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:42:44,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:44,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:44,956 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:44,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 19:42:45,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:42:45,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:42:45,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 19:42:45,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:45,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:45,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:45,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:45,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:45,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:45,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-11 19:42:45,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-10-11 19:42:45,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:45,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-10-11 19:42:46,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:46,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 51 [2024-10-11 19:42:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:46,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:46,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:46,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068498930] [2024-10-11 19:42:46,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068498930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:46,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:46,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 19:42:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978435107] [2024-10-11 19:42:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:46,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:42:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:42:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:42:47,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-10-11 19:42:47,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 481 flow. Second operand has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:47,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:47,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-10-11 19:42:47,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:50,828 INFO L124 PetriNetUnfolderBase]: 914/1750 cut-off events. [2024-10-11 19:42:50,829 INFO L125 PetriNetUnfolderBase]: For 3035/3035 co-relation queries the response was YES. [2024-10-11 19:42:50,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5820 conditions, 1750 events. 914/1750 cut-off events. For 3035/3035 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9620 event pairs, 86 based on Foata normal form. 2/1752 useless extension candidates. Maximal degree in co-relation 5800. Up to 438 conditions per place. [2024-10-11 19:42:50,834 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 128 selfloop transitions, 67 changer transitions 0/206 dead transitions. [2024-10-11 19:42:50,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 206 transitions, 1406 flow [2024-10-11 19:42:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 19:42:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 19:42:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 764 transitions. [2024-10-11 19:42:50,836 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45913461538461536 [2024-10-11 19:42:50,836 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 481 flow. Second operand 16 states and 764 transitions. [2024-10-11 19:42:50,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 206 transitions, 1406 flow [2024-10-11 19:42:50,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 206 transitions, 1357 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-10-11 19:42:50,841 INFO L231 Difference]: Finished difference. Result has 114 places, 130 transitions, 958 flow [2024-10-11 19:42:50,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=958, PETRI_PLACES=114, PETRI_TRANSITIONS=130} [2024-10-11 19:42:50,841 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 16 predicate places. [2024-10-11 19:42:50,841 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 130 transitions, 958 flow [2024-10-11 19:42:50,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:50,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:50,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:50,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:51,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:51,042 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:51,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1797279580, now seen corresponding path program 3 times [2024-10-11 19:42:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:51,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081479827] [2024-10-11 19:42:51,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:42:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:51,044 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:51,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 19:42:51,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-11 19:42:51,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:42:51,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 19:42:51,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:51,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:51,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:51,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:51,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:51,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:51,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-11 19:42:51,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-10-11 19:42:51,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:51,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-10-11 19:42:52,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:52,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 51 [2024-10-11 19:42:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:52,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:52,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081479827] [2024-10-11 19:42:52,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081479827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:52,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:52,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 19:42:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704179583] [2024-10-11 19:42:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:52,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:42:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:42:52,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:42:53,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-10-11 19:42:53,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 130 transitions, 958 flow. Second operand has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:53,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:53,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-10-11 19:42:53,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:58,322 INFO L124 PetriNetUnfolderBase]: 953/1838 cut-off events. [2024-10-11 19:42:58,322 INFO L125 PetriNetUnfolderBase]: For 5463/5463 co-relation queries the response was YES. [2024-10-11 19:42:58,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6933 conditions, 1838 events. 953/1838 cut-off events. For 5463/5463 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10236 event pairs, 159 based on Foata normal form. 1/1839 useless extension candidates. Maximal degree in co-relation 6903. Up to 393 conditions per place. [2024-10-11 19:42:58,329 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 155 selfloop transitions, 69 changer transitions 0/233 dead transitions. [2024-10-11 19:42:58,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 233 transitions, 1937 flow [2024-10-11 19:42:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 19:42:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 19:42:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 783 transitions. [2024-10-11 19:42:58,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47055288461538464 [2024-10-11 19:42:58,332 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 958 flow. Second operand 16 states and 783 transitions. [2024-10-11 19:42:58,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 233 transitions, 1937 flow [2024-10-11 19:42:58,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 233 transitions, 1836 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-10-11 19:42:58,344 INFO L231 Difference]: Finished difference. Result has 124 places, 146 transitions, 1253 flow [2024-10-11 19:42:58,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1253, PETRI_PLACES=124, PETRI_TRANSITIONS=146} [2024-10-11 19:42:58,345 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2024-10-11 19:42:58,345 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 146 transitions, 1253 flow [2024-10-11 19:42:58,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:42:58,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:58,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:58,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:58,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:58,546 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:42:58,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1011824510, now seen corresponding path program 1 times [2024-10-11 19:42:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812281716] [2024-10-11 19:42:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:58,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:42:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:58,548 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:42:58,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 19:42:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:58,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 19:42:58,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:58,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:58,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:58,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:58,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-11 19:42:58,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:58,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:58,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:58,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:58,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:58,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-10-11 19:42:59,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 125 [2024-10-11 19:42:59,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:59,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:59,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:59,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:59,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:59,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 141 [2024-10-11 19:42:59,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:59,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 233 treesize of output 173 [2024-10-11 19:42:59,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:59,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-10-11 19:42:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:59,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:59,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812281716] [2024-10-11 19:42:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812281716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 19:42:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416525822] [2024-10-11 19:42:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:59,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:42:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:42:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:43:00,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-10-11 19:43:00,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 146 transitions, 1253 flow. Second operand has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:00,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:00,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-10-11 19:43:00,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:04,436 INFO L124 PetriNetUnfolderBase]: 1016/1970 cut-off events. [2024-10-11 19:43:04,436 INFO L125 PetriNetUnfolderBase]: For 6673/6673 co-relation queries the response was YES. [2024-10-11 19:43:04,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8022 conditions, 1970 events. 1016/1970 cut-off events. For 6673/6673 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11166 event pairs, 153 based on Foata normal form. 1/1971 useless extension candidates. Maximal degree in co-relation 7988. Up to 1148 conditions per place. [2024-10-11 19:43:04,445 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 156 selfloop transitions, 75 changer transitions 0/239 dead transitions. [2024-10-11 19:43:04,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 239 transitions, 2376 flow [2024-10-11 19:43:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 19:43:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-11 19:43:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 809 transitions. [2024-10-11 19:43:04,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4321581196581197 [2024-10-11 19:43:04,447 INFO L175 Difference]: Start difference. First operand has 124 places, 146 transitions, 1253 flow. Second operand 18 states and 809 transitions. [2024-10-11 19:43:04,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 239 transitions, 2376 flow [2024-10-11 19:43:04,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 239 transitions, 2226 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-10-11 19:43:04,463 INFO L231 Difference]: Finished difference. Result has 148 places, 188 transitions, 1834 flow [2024-10-11 19:43:04,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1834, PETRI_PLACES=148, PETRI_TRANSITIONS=188} [2024-10-11 19:43:04,464 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 50 predicate places. [2024-10-11 19:43:04,464 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 188 transitions, 1834 flow [2024-10-11 19:43:04,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:04,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:04,464 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:04,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-11 19:43:04,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:04,665 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:43:04,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1309497594, now seen corresponding path program 2 times [2024-10-11 19:43:04,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:43:04,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343725361] [2024-10-11 19:43:04,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:43:04,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:04,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:43:04,667 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:43:04,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-11 19:43:04,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:43:04,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:43:04,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 19:43:04,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:04,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:04,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:04,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:04,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-11 19:43:05,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:05,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:05,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:05,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:05,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:05,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-10-11 19:43:05,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 125 [2024-10-11 19:43:05,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:05,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:05,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:05,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:05,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:05,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 141 [2024-10-11 19:43:05,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:43:05,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 233 treesize of output 173 [2024-10-11 19:43:05,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:43:05,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-10-11 19:43:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:43:05,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:43:05,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:43:05,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343725361] [2024-10-11 19:43:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343725361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:43:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:43:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 19:43:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328550165] [2024-10-11 19:43:05,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:43:05,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:43:05,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:43:05,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:43:05,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:43:06,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-10-11 19:43:06,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 188 transitions, 1834 flow. Second operand has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:06,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:06,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-10-11 19:43:06,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:12,590 INFO L124 PetriNetUnfolderBase]: 1195/2311 cut-off events. [2024-10-11 19:43:12,590 INFO L125 PetriNetUnfolderBase]: For 10516/10516 co-relation queries the response was YES. [2024-10-11 19:43:12,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10703 conditions, 2311 events. 1195/2311 cut-off events. For 10516/10516 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13619 event pairs, 190 based on Foata normal form. 2/2313 useless extension candidates. Maximal degree in co-relation 10660. Up to 1255 conditions per place. [2024-10-11 19:43:12,603 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 177 selfloop transitions, 107 changer transitions 0/292 dead transitions. [2024-10-11 19:43:12,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 292 transitions, 3258 flow [2024-10-11 19:43:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:43:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:43:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 902 transitions. [2024-10-11 19:43:12,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43365384615384617 [2024-10-11 19:43:12,604 INFO L175 Difference]: Start difference. First operand has 148 places, 188 transitions, 1834 flow. Second operand 20 states and 902 transitions. [2024-10-11 19:43:12,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 292 transitions, 3258 flow [2024-10-11 19:43:12,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 292 transitions, 3052 flow, removed 75 selfloop flow, removed 4 redundant places. [2024-10-11 19:43:12,629 INFO L231 Difference]: Finished difference. Result has 172 places, 240 transitions, 2592 flow [2024-10-11 19:43:12,629 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2592, PETRI_PLACES=172, PETRI_TRANSITIONS=240} [2024-10-11 19:43:12,629 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 74 predicate places. [2024-10-11 19:43:12,629 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 240 transitions, 2592 flow [2024-10-11 19:43:12,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:12,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:12,630 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:12,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-10-11 19:43:12,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:12,830 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:43:12,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:12,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1697248544, now seen corresponding path program 3 times [2024-10-11 19:43:12,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:43:12,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001120777] [2024-10-11 19:43:12,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:43:12,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:12,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:43:12,832 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:43:12,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-11 19:43:13,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-11 19:43:13,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:43:13,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 19:43:13,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:13,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:13,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:13,113 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:13,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-11 19:43:13,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:13,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:13,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:13,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:13,248 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:13,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-10-11 19:43:13,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 28 disjoint index pairs (out of 66 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 42 [2024-10-11 19:43:13,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:13,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:13,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:13,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:13,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:13,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 81 [2024-10-11 19:43:13,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:43:13,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 129 [2024-10-11 19:43:13,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:43:13,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 285 [2024-10-11 19:43:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:43:13,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:43:13,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:43:13,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001120777] [2024-10-11 19:43:13,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001120777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:43:13,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:43:13,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 19:43:13,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282267512] [2024-10-11 19:43:13,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:43:13,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:43:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:43:13,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:43:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:43:15,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-10-11 19:43:15,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 240 transitions, 2592 flow. Second operand has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:15,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:15,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-10-11 19:43:15,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:19,620 INFO L124 PetriNetUnfolderBase]: 1564/3063 cut-off events. [2024-10-11 19:43:19,620 INFO L125 PetriNetUnfolderBase]: For 18519/18519 co-relation queries the response was YES. [2024-10-11 19:43:19,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15337 conditions, 3063 events. 1564/3063 cut-off events. For 18519/18519 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19608 event pairs, 329 based on Foata normal form. 2/3065 useless extension candidates. Maximal degree in co-relation 15287. Up to 1406 conditions per place. [2024-10-11 19:43:19,635 INFO L140 encePairwiseOnDemand]: 86/104 looper letters, 263 selfloop transitions, 133 changer transitions 0/404 dead transitions. [2024-10-11 19:43:19,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 404 transitions, 4787 flow [2024-10-11 19:43:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 19:43:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 19:43:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1022 transitions. [2024-10-11 19:43:19,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44667832167832167 [2024-10-11 19:43:19,637 INFO L175 Difference]: Start difference. First operand has 172 places, 240 transitions, 2592 flow. Second operand 22 states and 1022 transitions. [2024-10-11 19:43:19,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 404 transitions, 4787 flow [2024-10-11 19:43:19,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 404 transitions, 4437 flow, removed 140 selfloop flow, removed 5 redundant places. [2024-10-11 19:43:19,702 INFO L231 Difference]: Finished difference. Result has 201 places, 291 transitions, 3433 flow [2024-10-11 19:43:19,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3433, PETRI_PLACES=201, PETRI_TRANSITIONS=291} [2024-10-11 19:43:19,703 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 103 predicate places. [2024-10-11 19:43:19,703 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 291 transitions, 3433 flow [2024-10-11 19:43:19,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:19,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:19,703 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:19,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-11 19:43:19,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:19,904 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:43:19,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:19,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1230141806, now seen corresponding path program 4 times [2024-10-11 19:43:19,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:43:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130070931] [2024-10-11 19:43:19,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:43:19,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:19,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:43:19,906 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:43:19,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-11 19:43:20,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:43:20,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:43:20,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 19:43:20,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:20,190 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:20,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:20,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:20,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-11 19:43:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:20,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:20,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:20,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:20,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:20,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-10-11 19:43:20,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 125 [2024-10-11 19:43:20,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:20,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:20,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:43:20,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:20,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:43:20,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 141 [2024-10-11 19:43:20,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:43:20,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 233 treesize of output 173 [2024-10-11 19:43:21,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:43:21,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-10-11 19:43:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:43:21,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:43:21,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:43:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130070931] [2024-10-11 19:43:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130070931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:43:21,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:43:21,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 19:43:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571744962] [2024-10-11 19:43:21,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:43:21,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:43:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:43:21,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:43:21,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:43:21,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-10-11 19:43:21,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 291 transitions, 3433 flow. Second operand has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:21,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:21,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-10-11 19:43:21,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:27,182 INFO L124 PetriNetUnfolderBase]: 1666/3283 cut-off events. [2024-10-11 19:43:27,183 INFO L125 PetriNetUnfolderBase]: For 22562/22562 co-relation queries the response was YES. [2024-10-11 19:43:27,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16824 conditions, 3283 events. 1666/3283 cut-off events. For 22562/22562 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21566 event pairs, 320 based on Foata normal form. 2/3285 useless extension candidates. Maximal degree in co-relation 16762. Up to 1795 conditions per place. [2024-10-11 19:43:27,205 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 219 selfloop transitions, 145 changer transitions 0/372 dead transitions. [2024-10-11 19:43:27,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 372 transitions, 4811 flow [2024-10-11 19:43:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:43:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:43:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 900 transitions. [2024-10-11 19:43:27,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2024-10-11 19:43:27,206 INFO L175 Difference]: Start difference. First operand has 201 places, 291 transitions, 3433 flow. Second operand 20 states and 900 transitions. [2024-10-11 19:43:27,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 372 transitions, 4811 flow [2024-10-11 19:43:27,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 372 transitions, 4640 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-10-11 19:43:27,291 INFO L231 Difference]: Finished difference. Result has 225 places, 324 transitions, 4104 flow [2024-10-11 19:43:27,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=3272, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4104, PETRI_PLACES=225, PETRI_TRANSITIONS=324} [2024-10-11 19:43:27,291 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 127 predicate places. [2024-10-11 19:43:27,291 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 324 transitions, 4104 flow [2024-10-11 19:43:27,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:27,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:27,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:27,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-10-11 19:43:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:27,492 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-10-11 19:43:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash 236066558, now seen corresponding path program 5 times [2024-10-11 19:43:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:43:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448326952] [2024-10-11 19:43:27,493 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:43:27,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:27,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:43:27,494 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:43:27,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-11 19:43:27,752 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:43:27,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 19:43:27,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:43:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:43:27,930 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:43:27,931 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:43:27,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (44 of 45 remaining) [2024-10-11 19:43:27,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2024-10-11 19:43:27,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2024-10-11 19:43:27,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (41 of 45 remaining) [2024-10-11 19:43:27,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2024-10-11 19:43:27,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2024-10-11 19:43:27,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2024-10-11 19:43:27,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2024-10-11 19:43:27,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2024-10-11 19:43:27,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2024-10-11 19:43:27,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2024-10-11 19:43:27,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2024-10-11 19:43:27,934 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (24 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2024-10-11 19:43:27,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (21 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2024-10-11 19:43:27,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 45 remaining) [2024-10-11 19:43:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 45 remaining) [2024-10-11 19:43:27,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-11 19:43:28,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:43:28,138 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:28,174 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:43:28,174 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:43:28,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:43:28 BasicIcfg [2024-10-11 19:43:28,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:43:28,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:43:28,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:43:28,177 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:43:28,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:42:17" (3/4) ... [2024-10-11 19:43:28,178 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:43:28,179 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:43:28,180 INFO L158 Benchmark]: Toolchain (without parser) took 72674.56ms. Allocated memory was 62.9MB in the beginning and 872.4MB in the end (delta: 809.5MB). Free memory was 36.6MB in the beginning and 301.6MB in the end (delta: -265.1MB). Peak memory consumption was 544.3MB. Max. memory is 16.1GB. [2024-10-11 19:43:28,180 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:43:28,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.35ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 36.3MB in the beginning and 45.9MB in the end (delta: -9.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-11 19:43:28,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.56ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 43.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:43:28,180 INFO L158 Benchmark]: Boogie Preprocessor took 86.11ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 38.6MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 19:43:28,180 INFO L158 Benchmark]: RCFGBuilder took 745.20ms. Allocated memory is still 83.9MB. Free memory was 38.6MB in the beginning and 40.0MB in the end (delta: -1.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-10-11 19:43:28,181 INFO L158 Benchmark]: TraceAbstraction took 71150.87ms. Allocated memory was 83.9MB in the beginning and 872.4MB in the end (delta: 788.5MB). Free memory was 39.5MB in the beginning and 302.7MB in the end (delta: -263.2MB). Peak memory consumption was 525.4MB. Max. memory is 16.1GB. [2024-10-11 19:43:28,181 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 872.4MB. Free memory was 302.7MB in the beginning and 301.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:43:28,182 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.22ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.35ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 36.3MB in the beginning and 45.9MB in the end (delta: -9.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.56ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 43.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.11ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 38.6MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 745.20ms. Allocated memory is still 83.9MB. Free memory was 38.6MB in the beginning and 40.0MB in the end (delta: -1.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 71150.87ms. Allocated memory was 83.9MB in the beginning and 872.4MB in the end (delta: 788.5MB). Free memory was 39.5MB in the beginning and 302.7MB in the end (delta: -263.2MB). Peak memory consumption was 525.4MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 872.4MB. Free memory was 302.7MB in the beginning and 301.6MB in the end (delta: 1.0MB). 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; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] 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) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3931] 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}, lb=0, res=0, t1=0, t2=1] [L3932] 0 return 0; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result=0, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3917] 1 return 0; [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3917] 2 return 0; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={3:24}, \old(expression)=1, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, expression=1, lb=0, t1=0, t2=1] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [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_2-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_2-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, 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: 3949]: 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: 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: 3931]: 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: 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: -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, 108 locations, 45 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: 71.0s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 53.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4730 SdHoareTripleChecker+Valid, 39.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3963 mSDsluCounter, 2731 SdHoareTripleChecker+Invalid, 37.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 115 IncrementalHoareTripleChecker+Unchecked, 2555 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16522 IncrementalHoareTripleChecker+Invalid, 16819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 176 mSDtfsCounter, 16522 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 302 SyntacticMatches, 3 SemanticMatches, 228 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4104occurred in iteration=25, InterpolantAutomatonStates: 223, 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.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 420 ConstructedInterpolants, 25 QuantifiedInterpolants, 21265 SizeOfPredicates, 296 NumberOfNonLiveVariables, 4132 ConjunctsInSsa, 462 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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-10-11 19:43:28,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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