./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:12:46,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:12:46,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:12:46,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:12:46,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:12:46,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:12:46,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:12:46,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:12:46,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:12:46,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:12:46,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:12:46,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:12:46,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:12:46,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:12:46,107 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:12:46,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:12:46,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:12:46,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:12:46,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:12:46,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:12:46,108 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:12:46,108 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:12:46,108 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:12:46,109 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:12:46,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:12:46,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:12:46,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:12:46,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:12:46,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:12:46,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:12:46,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:12:46,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:12:46,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:12:46,110 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a [2025-03-04 10:12:46,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:12:46,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:12:46,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:12:46,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:12:46,358 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:12:46,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-04 10:12:47,476 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef52e9586/5734354e717b49aa95f29c81c7a81a95/FLAG365696d9c [2025-03-04 10:12:47,691 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:12:47,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-04 10:12:47,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef52e9586/5734354e717b49aa95f29c81c7a81a95/FLAG365696d9c [2025-03-04 10:12:47,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef52e9586/5734354e717b49aa95f29c81c7a81a95 [2025-03-04 10:12:47,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:12:47,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:12:47,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:12:47,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:12:47,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:12:47,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47, skipping insertion in model container [2025-03-04 10:12:47,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:12:47,849 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:12:47,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:12:47,860 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:12:47,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:12:47,895 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:12:47,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47 WrapperNode [2025-03-04 10:12:47,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:12:47,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:12:47,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:12:47,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:12:47,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,921 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 172 [2025-03-04 10:12:47,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:12:47,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:12:47,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:12:47,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:12:47,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,943 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:12:47,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:12:47,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:12:47,953 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:12:47,953 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:12:47,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (1/1) ... [2025-03-04 10:12:47,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:12:47,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:47,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:12:47,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:12:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:12:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:12:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:12:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:12:47,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:12:47,992 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:12:48,060 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:12:48,061 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:12:48,292 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:12:48,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:12:48,443 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:12:48,444 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:12:48,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:12:48 BoogieIcfgContainer [2025-03-04 10:12:48,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:12:48,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:12:48,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:12:48,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:12:48,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:12:47" (1/3) ... [2025-03-04 10:12:48,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74148892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:12:48, skipping insertion in model container [2025-03-04 10:12:48,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:47" (2/3) ... [2025-03-04 10:12:48,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74148892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:12:48, skipping insertion in model container [2025-03-04 10:12:48,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:12:48" (3/3) ... [2025-03-04 10:12:48,453 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-03-04 10:12:48,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:12:48,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 41 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-04 10:12:48,477 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:12:48,521 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:12:48,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 109 flow [2025-03-04 10:12:48,574 INFO L124 PetriNetUnfolderBase]: 4/41 cut-off events. [2025-03-04 10:12:48,578 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:12:48,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 4/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-03-04 10:12:48,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 109 flow [2025-03-04 10:12:48,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 40 transitions, 98 flow [2025-03-04 10:12:48,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:12:48,604 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;@430e0f21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:12:48,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 10:12:48,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:12:48,609 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:12:48,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:12:48,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:48,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:12:48,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 525224, now seen corresponding path program 1 times [2025-03-04 10:12:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587262006] [2025-03-04 10:12:48,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:48,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:12:48,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:12:48,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:48,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587262006] [2025-03-04 10:12:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587262006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:48,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:48,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:12:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239803243] [2025-03-04 10:12:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:48,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:12:48,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:48,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:12:48,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:12:48,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:48,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-03-04 10:12:48,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:48,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:48,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:49,109 INFO L124 PetriNetUnfolderBase]: 1316/1966 cut-off events. [2025-03-04 10:12:49,109 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-04 10:12:49,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 1966 events. 1316/1966 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10147 event pairs, 1060 based on Foata normal form. 1/1449 useless extension candidates. Maximal degree in co-relation 3673. Up to 1877 conditions per place. [2025-03-04 10:12:49,126 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 30 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-04 10:12:49,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 156 flow [2025-03-04 10:12:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:12:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:12:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-04 10:12:49,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2025-03-04 10:12:49,135 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 98 flow. Second operand 3 states and 61 transitions. [2025-03-04 10:12:49,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 156 flow [2025-03-04 10:12:49,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:12:49,140 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 84 flow [2025-03-04 10:12:49,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-04 10:12:49,144 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-03-04 10:12:49,144 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 84 flow [2025-03-04 10:12:49,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-03-04 10:12:49,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:49,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:12:49,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:12:49,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:49,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash 525225, now seen corresponding path program 1 times [2025-03-04 10:12:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948949782] [2025-03-04 10:12:49,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:49,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:12:49,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:12:49,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:49,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:49,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948949782] [2025-03-04 10:12:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948949782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:49,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:49,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:12:49,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208287284] [2025-03-04 10:12:49,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:49,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:12:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:49,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:12:49,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:12:49,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:49,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2025-03-04 10:12:49,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:49,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:49,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:49,644 INFO L124 PetriNetUnfolderBase]: 1317/1969 cut-off events. [2025-03-04 10:12:49,644 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 10:12:49,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3901 conditions, 1969 events. 1317/1969 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10122 event pairs, 1060 based on Foata normal form. 0/1451 useless extension candidates. Maximal degree in co-relation 3879. Up to 1882 conditions per place. [2025-03-04 10:12:49,657 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 32 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-03-04 10:12:49,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 164 flow [2025-03-04 10:12:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:12:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:12:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-04 10:12:49,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4147727272727273 [2025-03-04 10:12:49,659 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 84 flow. Second operand 4 states and 73 transitions. [2025-03-04 10:12:49,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 164 flow [2025-03-04 10:12:49,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:49,661 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 107 flow [2025-03-04 10:12:49,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-03-04 10:12:49,662 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2025-03-04 10:12:49,663 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 107 flow [2025-03-04 10:12:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2025-03-04 10:12:49,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:49,663 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:12:49,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:12:49,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash 504758081, now seen corresponding path program 1 times [2025-03-04 10:12:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617428938] [2025-03-04 10:12:49,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:49,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:49,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:12:49,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:12:49,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:49,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:49,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617428938] [2025-03-04 10:12:49,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617428938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974295978] [2025-03-04 10:12:49,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:49,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:49,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:49,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:49,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:12:49,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:12:49,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:12:49,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:49,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:49,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:12:49,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:50,001 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 10 treesize of output 9 [2025-03-04 10:12:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:50,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:50,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974295978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:50,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:50,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:12:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574183062] [2025-03-04 10:12:50,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:50,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:12:50,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:50,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:12:50,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:12:50,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:50,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 107 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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) [2025-03-04 10:12:50,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:50,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:50,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:50,608 INFO L124 PetriNetUnfolderBase]: 1317/1968 cut-off events. [2025-03-04 10:12:50,608 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 10:12:50,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3908 conditions, 1968 events. 1317/1968 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10142 event pairs, 1060 based on Foata normal form. 0/1450 useless extension candidates. Maximal degree in co-relation 3886. Up to 1878 conditions per place. [2025-03-04 10:12:50,616 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 28 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2025-03-04 10:12:50,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 173 flow [2025-03-04 10:12:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:12:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:12:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-03-04 10:12:50,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2025-03-04 10:12:50,620 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 107 flow. Second operand 6 states and 90 transitions. [2025-03-04 10:12:50,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 173 flow [2025-03-04 10:12:50,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:12:50,621 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 114 flow [2025-03-04 10:12:50,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-03-04 10:12:50,622 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-03-04 10:12:50,623 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 114 flow [2025-03-04 10:12:50,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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) [2025-03-04 10:12:50,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:50,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:12:50,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:12:50,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:50,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:50,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1530123608, now seen corresponding path program 1 times [2025-03-04 10:12:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:50,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38459071] [2025-03-04 10:12:50,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:12:50,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:12:50,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:50,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38459071] [2025-03-04 10:12:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38459071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:50,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:50,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:12:50,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942802285] [2025-03-04 10:12:50,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:50,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:12:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:50,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:12:50,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:12:50,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:50,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2025-03-04 10:12:50,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:50,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:50,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:51,012 INFO L124 PetriNetUnfolderBase]: 793/1202 cut-off events. [2025-03-04 10:12:51,012 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 10:12:51,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 1202 events. 793/1202 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5509 event pairs, 608 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 2367. Up to 1135 conditions per place. [2025-03-04 10:12:51,017 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-03-04 10:12:51,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 172 flow [2025-03-04 10:12:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:12:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:12:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-03-04 10:12:51,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-03-04 10:12:51,018 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 114 flow. Second operand 4 states and 68 transitions. [2025-03-04 10:12:51,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 172 flow [2025-03-04 10:12:51,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 142 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:12:51,020 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 84 flow [2025-03-04 10:12:51,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-03-04 10:12:51,021 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -8 predicate places. [2025-03-04 10:12:51,021 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 84 flow [2025-03-04 10:12:51,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2025-03-04 10:12:51,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:51,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:12:51,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:12:51,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:51,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:51,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1530123607, now seen corresponding path program 1 times [2025-03-04 10:12:51,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:51,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976882609] [2025-03-04 10:12:51,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:51,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:12:51,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:12:51,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:51,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:51,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976882609] [2025-03-04 10:12:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976882609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:12:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965285803] [2025-03-04 10:12:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:51,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:51,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:51,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:51,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:51,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2025-03-04 10:12:51,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:51,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:51,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:51,311 INFO L124 PetriNetUnfolderBase]: 1374/2100 cut-off events. [2025-03-04 10:12:51,311 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 10:12:51,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4164 conditions, 2100 events. 1374/2100 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10447 event pairs, 908 based on Foata normal form. 0/1754 useless extension candidates. Maximal degree in co-relation 2794. Up to 1347 conditions per place. [2025-03-04 10:12:51,319 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 65 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2025-03-04 10:12:51,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 306 flow [2025-03-04 10:12:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-04 10:12:51,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-03-04 10:12:51,321 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 84 flow. Second operand 5 states and 116 transitions. [2025-03-04 10:12:51,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 73 transitions, 306 flow [2025-03-04 10:12:51,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:51,322 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 105 flow [2025-03-04 10:12:51,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2025-03-04 10:12:51,323 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2025-03-04 10:12:51,323 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 105 flow [2025-03-04 10:12:51,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2025-03-04 10:12:51,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:51,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:51,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:12:51,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:51,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash 570255377, now seen corresponding path program 1 times [2025-03-04 10:12:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401089953] [2025-03-04 10:12:51,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:51,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:12:51,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:12:51,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:51,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401089953] [2025-03-04 10:12:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401089953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733239791] [2025-03-04 10:12:51,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:51,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:51,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:51,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:51,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:12:51,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:12:51,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:12:51,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:51,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:51,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:12:51,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:51,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:51,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:12:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:51,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733239791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:51,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:51,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:12:51,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392972071] [2025-03-04 10:12:51,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:51,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:12:51,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:51,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:12:51,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:12:51,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-04 10:12:51,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 105 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:51,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:51,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-04 10:12:51,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:52,043 INFO L124 PetriNetUnfolderBase]: 1583/2423 cut-off events. [2025-03-04 10:12:52,044 INFO L125 PetriNetUnfolderBase]: For 525/584 co-relation queries the response was YES. [2025-03-04 10:12:52,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5266 conditions, 2423 events. 1583/2423 cut-off events. For 525/584 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12391 event pairs, 841 based on Foata normal form. 0/2114 useless extension candidates. Maximal degree in co-relation 3639. Up to 987 conditions per place. [2025-03-04 10:12:52,057 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 78 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2025-03-04 10:12:52,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 91 transitions, 397 flow [2025-03-04 10:12:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:12:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:12:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2025-03-04 10:12:52,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.512987012987013 [2025-03-04 10:12:52,058 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 105 flow. Second operand 7 states and 158 transitions. [2025-03-04 10:12:52,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 91 transitions, 397 flow [2025-03-04 10:12:52,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 91 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:52,060 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 141 flow [2025-03-04 10:12:52,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-04 10:12:52,062 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-03-04 10:12:52,062 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 141 flow [2025-03-04 10:12:52,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:52,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:52,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:52,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:12:52,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:12:52,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1596048645, now seen corresponding path program 1 times [2025-03-04 10:12:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:52,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113835857] [2025-03-04 10:12:52,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:52,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:52,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:12:52,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:12:52,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:52,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113835857] [2025-03-04 10:12:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113835857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:12:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520843983] [2025-03-04 10:12:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:52,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:52,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:52,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:52,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:52,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2025-03-04 10:12:52,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:52,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:52,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:52,536 INFO L124 PetriNetUnfolderBase]: 1597/2380 cut-off events. [2025-03-04 10:12:52,537 INFO L125 PetriNetUnfolderBase]: For 2132/2263 co-relation queries the response was YES. [2025-03-04 10:12:52,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 2380 events. 1597/2380 cut-off events. For 2132/2263 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11077 event pairs, 1152 based on Foata normal form. 0/2088 useless extension candidates. Maximal degree in co-relation 5103. Up to 1932 conditions per place. [2025-03-04 10:12:52,548 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 61 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-03-04 10:12:52,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 345 flow [2025-03-04 10:12:52,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-04 10:12:52,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954545454545455 [2025-03-04 10:12:52,550 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 141 flow. Second operand 5 states and 109 transitions. [2025-03-04 10:12:52,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 345 flow [2025-03-04 10:12:52,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 331 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:12:52,552 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 154 flow [2025-03-04 10:12:52,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-03-04 10:12:52,553 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2025-03-04 10:12:52,553 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 154 flow [2025-03-04 10:12:52,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2025-03-04 10:12:52,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:52,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:52,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:12:52,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:52,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:52,554 INFO L85 PathProgramCache]: Analyzing trace with hash -518380450, now seen corresponding path program 1 times [2025-03-04 10:12:52,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:52,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403111456] [2025-03-04 10:12:52,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:52,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:52,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:12:52,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:12:52,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:52,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:52,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403111456] [2025-03-04 10:12:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403111456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:12:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129623805] [2025-03-04 10:12:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:52,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:52,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:52,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:52,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:52,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) [2025-03-04 10:12:52,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:52,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:52,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:52,833 INFO L124 PetriNetUnfolderBase]: 1468/2137 cut-off events. [2025-03-04 10:12:52,834 INFO L125 PetriNetUnfolderBase]: For 2052/2268 co-relation queries the response was YES. [2025-03-04 10:12:52,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5745 conditions, 2137 events. 1468/2137 cut-off events. For 2052/2268 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9634 event pairs, 1104 based on Foata normal form. 0/1876 useless extension candidates. Maximal degree in co-relation 5092. Up to 1890 conditions per place. [2025-03-04 10:12:52,844 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 54 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-04 10:12:52,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 332 flow [2025-03-04 10:12:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-03-04 10:12:52,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2025-03-04 10:12:52,845 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 154 flow. Second operand 5 states and 102 transitions. [2025-03-04 10:12:52,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 332 flow [2025-03-04 10:12:52,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:52,848 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 174 flow [2025-03-04 10:12:52,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-03-04 10:12:52,849 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2025-03-04 10:12:52,849 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 174 flow [2025-03-04 10:12:52,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) [2025-03-04 10:12:52,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:52,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:12:52,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:52,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1766474141, now seen corresponding path program 1 times [2025-03-04 10:12:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:52,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011927379] [2025-03-04 10:12:52,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:52,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:12:52,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:12:52,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:52,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011927379] [2025-03-04 10:12:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011927379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339174076] [2025-03-04 10:12:52,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:52,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:52,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:52,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:52,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:12:52,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:12:53,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:12:53,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:53,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:53,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:12:53,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:53,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:12:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:53,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:53,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339174076] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:53,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:12:53,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-03-04 10:12:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982606795] [2025-03-04 10:12:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:53,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:12:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:53,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:12:53,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:12:53,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-04 10:12:53,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-03-04 10:12:53,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:53,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-04 10:12:53,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:53,427 INFO L124 PetriNetUnfolderBase]: 1586/2382 cut-off events. [2025-03-04 10:12:53,427 INFO L125 PetriNetUnfolderBase]: For 2284/2520 co-relation queries the response was YES. [2025-03-04 10:12:53,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6602 conditions, 2382 events. 1586/2382 cut-off events. For 2284/2520 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11479 event pairs, 796 based on Foata normal form. 0/2169 useless extension candidates. Maximal degree in co-relation 5858. Up to 1300 conditions per place. [2025-03-04 10:12:53,440 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 62 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2025-03-04 10:12:53,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 414 flow [2025-03-04 10:12:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:12:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:12:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2025-03-04 10:12:53,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-03-04 10:12:53,441 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 174 flow. Second operand 6 states and 125 transitions. [2025-03-04 10:12:53,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 414 flow [2025-03-04 10:12:53,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:53,445 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 206 flow [2025-03-04 10:12:53,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2025-03-04 10:12:53,446 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2025-03-04 10:12:53,446 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 206 flow [2025-03-04 10:12:53,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2025-03-04 10:12:53,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:53,447 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:53,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:12:53,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:53,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:53,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1882819570, now seen corresponding path program 1 times [2025-03-04 10:12:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836871749] [2025-03-04 10:12:53,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:53,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:12:53,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:12:53,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:53,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:53,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836871749] [2025-03-04 10:12:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836871749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594488899] [2025-03-04 10:12:53,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:53,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:53,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:53,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:53,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:12:53,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:12:53,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:12:53,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:53,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:53,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:12:53,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:53,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594488899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:53,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:12:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001350071] [2025-03-04 10:12:53,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:53,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:12:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:53,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:12:53,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:12:53,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:53,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 206 flow. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 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) [2025-03-04 10:12:53,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:53,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:53,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:54,388 INFO L124 PetriNetUnfolderBase]: 3161/4608 cut-off events. [2025-03-04 10:12:54,388 INFO L125 PetriNetUnfolderBase]: For 6355/6742 co-relation queries the response was YES. [2025-03-04 10:12:54,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14678 conditions, 4608 events. 3161/4608 cut-off events. For 6355/6742 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 23166 event pairs, 1711 based on Foata normal form. 74/4484 useless extension candidates. Maximal degree in co-relation 8353. Up to 2544 conditions per place. [2025-03-04 10:12:54,415 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 100 selfloop transitions, 13 changer transitions 0/116 dead transitions. [2025-03-04 10:12:54,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 116 transitions, 720 flow [2025-03-04 10:12:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:12:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:12:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2025-03-04 10:12:54,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46875 [2025-03-04 10:12:54,417 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 206 flow. Second operand 8 states and 165 transitions. [2025-03-04 10:12:54,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 116 transitions, 720 flow [2025-03-04 10:12:54,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 116 transitions, 699 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 10:12:54,426 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 292 flow [2025-03-04 10:12:54,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=292, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-03-04 10:12:54,427 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2025-03-04 10:12:54,427 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 292 flow [2025-03-04 10:12:54,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 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) [2025-03-04 10:12:54,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:54,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:54,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:12:54,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:54,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:54,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1088524858, now seen corresponding path program 1 times [2025-03-04 10:12:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036604603] [2025-03-04 10:12:54,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:54,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:12:54,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:12:54,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:54,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036604603] [2025-03-04 10:12:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036604603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044294347] [2025-03-04 10:12:54,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:54,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:54,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:54,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:54,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:12:54,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:12:54,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:12:54,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:54,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:54,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:12:54,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:54,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:12:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044294347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:54,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:12:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-03-04 10:12:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319176392] [2025-03-04 10:12:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:12:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:54,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:12:54,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:12:55,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:55,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 292 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:55,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:55,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:55,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:55,348 INFO L124 PetriNetUnfolderBase]: 2597/3790 cut-off events. [2025-03-04 10:12:55,349 INFO L125 PetriNetUnfolderBase]: For 9409/9849 co-relation queries the response was YES. [2025-03-04 10:12:55,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13239 conditions, 3790 events. 2597/3790 cut-off events. For 9409/9849 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 18366 event pairs, 861 based on Foata normal form. 0/3621 useless extension candidates. Maximal degree in co-relation 7046. Up to 1688 conditions per place. [2025-03-04 10:12:55,370 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 88 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2025-03-04 10:12:55,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 798 flow [2025-03-04 10:12:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:12:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:12:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-04 10:12:55,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-04 10:12:55,372 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 292 flow. Second operand 6 states and 110 transitions. [2025-03-04 10:12:55,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 798 flow [2025-03-04 10:12:55,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 783 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:12:55,378 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 303 flow [2025-03-04 10:12:55,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2025-03-04 10:12:55,379 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-03-04 10:12:55,379 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 303 flow [2025-03-04 10:12:55,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:55,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:55,379 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:55,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:12:55,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:12:55,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1388212106, now seen corresponding path program 2 times [2025-03-04 10:12:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-03-04 10:12:55,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:55,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:55,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:12:55,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:12:55,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:55,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:12:55,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-03-04 10:12:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411652019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271946085] [2025-03-04 10:12:55,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:55,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:55,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:55,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:55,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:12:55,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:12:55,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:12:55,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:55,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:55,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:12:55,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:12:55,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:55,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:12:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:12:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271946085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:56,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:12:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110449555] [2025-03-04 10:12:56,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:56,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:12:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:56,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:12:56,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:12:56,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:56,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 303 flow. Second operand has 20 states, 20 states have (on average 10.9) internal successors, (218), 20 states have internal predecessors, (218), 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) [2025-03-04 10:12:56,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:56,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:56,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:57,219 INFO L124 PetriNetUnfolderBase]: 3015/4303 cut-off events. [2025-03-04 10:12:57,219 INFO L125 PetriNetUnfolderBase]: For 7340/7807 co-relation queries the response was YES. [2025-03-04 10:12:57,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15516 conditions, 4303 events. 3015/4303 cut-off events. For 7340/7807 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 20330 event pairs, 535 based on Foata normal form. 124/4425 useless extension candidates. Maximal degree in co-relation 9343. Up to 713 conditions per place. [2025-03-04 10:12:57,239 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 172 selfloop transitions, 21 changer transitions 0/196 dead transitions. [2025-03-04 10:12:57,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 196 transitions, 1325 flow [2025-03-04 10:12:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:12:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:12:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 293 transitions. [2025-03-04 10:12:57,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47564935064935066 [2025-03-04 10:12:57,241 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 303 flow. Second operand 14 states and 293 transitions. [2025-03-04 10:12:57,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 196 transitions, 1325 flow [2025-03-04 10:12:57,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 196 transitions, 1253 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:12:57,250 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 359 flow [2025-03-04 10:12:57,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=359, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2025-03-04 10:12:57,251 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2025-03-04 10:12:57,251 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 359 flow [2025-03-04 10:12:57,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.9) internal successors, (218), 20 states have internal predecessors, (218), 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) [2025-03-04 10:12:57,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:57,252 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:57,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:12:57,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:57,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1203689351, now seen corresponding path program 1 times [2025-03-04 10:12:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281603050] [2025-03-04 10:12:57,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:57,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:57,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:12:57,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:12:57,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:57,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:57,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:57,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281603050] [2025-03-04 10:12:57,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281603050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:57,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251068612] [2025-03-04 10:12:57,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:57,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:57,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:57,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:57,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:12:57,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:12:57,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:12:57,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:57,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:57,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:12:57,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:57,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251068612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:57,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:57,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 10:12:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880076352] [2025-03-04 10:12:57,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:57,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:12:57,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:57,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:12:57,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:12:57,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:57,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 359 flow. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 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) [2025-03-04 10:12:57,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:57,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:57,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:58,196 INFO L124 PetriNetUnfolderBase]: 2777/4051 cut-off events. [2025-03-04 10:12:58,196 INFO L125 PetriNetUnfolderBase]: For 12177/12597 co-relation queries the response was YES. [2025-03-04 10:12:58,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15078 conditions, 4051 events. 2777/4051 cut-off events. For 12177/12597 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 18689 event pairs, 1566 based on Foata normal form. 54/4091 useless extension candidates. Maximal degree in co-relation 9771. Up to 2567 conditions per place. [2025-03-04 10:12:58,214 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 89 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2025-03-04 10:12:58,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 107 transitions, 823 flow [2025-03-04 10:12:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:12:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:12:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2025-03-04 10:12:58,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4403409090909091 [2025-03-04 10:12:58,216 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 359 flow. Second operand 8 states and 155 transitions. [2025-03-04 10:12:58,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 107 transitions, 823 flow [2025-03-04 10:12:58,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 107 transitions, 717 flow, removed 11 selfloop flow, removed 10 redundant places. [2025-03-04 10:12:58,225 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 371 flow [2025-03-04 10:12:58,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=371, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2025-03-04 10:12:58,226 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2025-03-04 10:12:58,226 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 371 flow [2025-03-04 10:12:58,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 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) [2025-03-04 10:12:58,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:58,226 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:58,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:12:58,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:58,427 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:58,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1667680993, now seen corresponding path program 2 times [2025-03-04 10:12:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33834244] [2025-03-04 10:12:58,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:58,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:12:58,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:12:58,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:58,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:12:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33834244] [2025-03-04 10:12:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33834244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520830732] [2025-03-04 10:12:58,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:58,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:58,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:58,564 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:58,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:12:58,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:12:58,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:12:58,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:58,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:12:58,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:12:58,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:58,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:12:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:12:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520830732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:58,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:12:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743042484] [2025-03-04 10:12:58,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:58,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:12:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:58,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:12:58,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:12:58,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:12:58,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 371 flow. Second operand has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 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) [2025-03-04 10:12:58,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:58,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:12:58,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:59,684 INFO L124 PetriNetUnfolderBase]: 3521/4979 cut-off events. [2025-03-04 10:12:59,684 INFO L125 PetriNetUnfolderBase]: For 10600/11179 co-relation queries the response was YES. [2025-03-04 10:12:59,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18209 conditions, 4979 events. 3521/4979 cut-off events. For 10600/11179 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 22675 event pairs, 528 based on Foata normal form. 168/5143 useless extension candidates. Maximal degree in co-relation 12974. Up to 912 conditions per place. [2025-03-04 10:12:59,705 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 167 selfloop transitions, 21 changer transitions 0/193 dead transitions. [2025-03-04 10:12:59,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 193 transitions, 1368 flow [2025-03-04 10:12:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:12:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:12:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 277 transitions. [2025-03-04 10:12:59,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4496753246753247 [2025-03-04 10:12:59,707 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 371 flow. Second operand 14 states and 277 transitions. [2025-03-04 10:12:59,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 193 transitions, 1368 flow [2025-03-04 10:12:59,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 193 transitions, 1352 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 10:12:59,719 INFO L231 Difference]: Finished difference. Result has 89 places, 64 transitions, 442 flow [2025-03-04 10:12:59,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=442, PETRI_PLACES=89, PETRI_TRANSITIONS=64} [2025-03-04 10:12:59,721 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 43 predicate places. [2025-03-04 10:12:59,721 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 64 transitions, 442 flow [2025-03-04 10:12:59,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 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) [2025-03-04 10:12:59,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:59,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:59,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:12:59,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:12:59,923 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:12:59,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1063930201, now seen corresponding path program 1 times [2025-03-04 10:12:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:59,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029659226] [2025-03-04 10:12:59,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:59,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:59,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:12:59,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:59,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:59,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:59,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029659226] [2025-03-04 10:12:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029659226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:59,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:59,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:12:59,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268805339] [2025-03-04 10:12:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:59,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:12:59,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:59,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:12:59,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:12:59,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-04 10:12:59,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 64 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2025-03-04 10:12:59,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:59,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-04 10:12:59,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:00,224 INFO L124 PetriNetUnfolderBase]: 3013/4544 cut-off events. [2025-03-04 10:13:00,225 INFO L125 PetriNetUnfolderBase]: For 15695/16349 co-relation queries the response was YES. [2025-03-04 10:13:00,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18075 conditions, 4544 events. 3013/4544 cut-off events. For 15695/16349 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 21895 event pairs, 715 based on Foata normal form. 3/4528 useless extension candidates. Maximal degree in co-relation 12298. Up to 3581 conditions per place. [2025-03-04 10:13:00,246 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 65 selfloop transitions, 4 changer transitions 8/85 dead transitions. [2025-03-04 10:13:00,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 719 flow [2025-03-04 10:13:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-04 10:13:00,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2025-03-04 10:13:00,248 INFO L175 Difference]: Start difference. First operand has 89 places, 64 transitions, 442 flow. Second operand 3 states and 74 transitions. [2025-03-04 10:13:00,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 719 flow [2025-03-04 10:13:00,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 650 flow, removed 13 selfloop flow, removed 9 redundant places. [2025-03-04 10:13:00,261 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 362 flow [2025-03-04 10:13:00,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=83, PETRI_TRANSITIONS=60} [2025-03-04 10:13:00,262 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places. [2025-03-04 10:13:00,262 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 362 flow [2025-03-04 10:13:00,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2025-03-04 10:13:00,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:00,262 INFO L206 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] [2025-03-04 10:13:00,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:13:00,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:13:00,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash -708442054, now seen corresponding path program 1 times [2025-03-04 10:13:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387495550] [2025-03-04 10:13:00,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:00,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:13:00,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:00,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:00,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387495550] [2025-03-04 10:13:00,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387495550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728670568] [2025-03-04 10:13:00,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:00,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:00,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:00,374 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:00,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:13:00,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:13:00,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:00,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:00,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:00,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:13:00,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:00,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:00,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728670568] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:00,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:13:00,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2025-03-04 10:13:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648740649] [2025-03-04 10:13:00,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:00,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:00,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:00,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:13:00,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-03-04 10:13:00,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 60 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) [2025-03-04 10:13:00,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:00,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-03-04 10:13:00,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:01,084 INFO L124 PetriNetUnfolderBase]: 4891/6942 cut-off events. [2025-03-04 10:13:01,085 INFO L125 PetriNetUnfolderBase]: For 19125/19661 co-relation queries the response was YES. [2025-03-04 10:13:01,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26413 conditions, 6942 events. 4891/6942 cut-off events. For 19125/19661 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 34071 event pairs, 1198 based on Foata normal form. 0/6488 useless extension candidates. Maximal degree in co-relation 19094. Up to 2538 conditions per place. [2025-03-04 10:13:01,122 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 156 selfloop transitions, 21 changer transitions 0/181 dead transitions. [2025-03-04 10:13:01,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 181 transitions, 1476 flow [2025-03-04 10:13:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2025-03-04 10:13:01,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-04 10:13:01,124 INFO L175 Difference]: Start difference. First operand has 83 places, 60 transitions, 362 flow. Second operand 9 states and 165 transitions. [2025-03-04 10:13:01,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 181 transitions, 1476 flow [2025-03-04 10:13:01,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 181 transitions, 1326 flow, removed 42 selfloop flow, removed 7 redundant places. [2025-03-04 10:13:01,155 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 432 flow [2025-03-04 10:13:01,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=432, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-03-04 10:13:01,156 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2025-03-04 10:13:01,156 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 432 flow [2025-03-04 10:13:01,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) [2025-03-04 10:13:01,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:01,156 INFO L206 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] [2025-03-04 10:13:01,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:13:01,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:13:01,357 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:13:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1695870210, now seen corresponding path program 2 times [2025-03-04 10:13:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:01,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767189468] [2025-03-04 10:13:01,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:01,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:13:01,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-03-04 10:13:01,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:13:01,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:01,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:01,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767189468] [2025-03-04 10:13:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767189468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:01,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:01,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:13:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742888191] [2025-03-04 10:13:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:01,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:01,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:01,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:13:01,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2025-03-04 10:13:01,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2025-03-04 10:13:01,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:01,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2025-03-04 10:13:01,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:02,450 INFO L124 PetriNetUnfolderBase]: 9829/13965 cut-off events. [2025-03-04 10:13:02,451 INFO L125 PetriNetUnfolderBase]: For 29439/29439 co-relation queries the response was YES. [2025-03-04 10:13:02,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51100 conditions, 13965 events. 9829/13965 cut-off events. For 29439/29439 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 72743 event pairs, 921 based on Foata normal form. 28/13515 useless extension candidates. Maximal degree in co-relation 38770. Up to 2968 conditions per place. [2025-03-04 10:13:02,516 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 313 selfloop transitions, 122 changer transitions 0/436 dead transitions. [2025-03-04 10:13:02,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 436 transitions, 3465 flow [2025-03-04 10:13:02,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:13:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:13:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 312 transitions. [2025-03-04 10:13:02,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41711229946524064 [2025-03-04 10:13:02,517 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 432 flow. Second operand 17 states and 312 transitions. [2025-03-04 10:13:02,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 436 transitions, 3465 flow [2025-03-04 10:13:02,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 436 transitions, 3462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:02,559 INFO L231 Difference]: Finished difference. Result has 108 places, 181 transitions, 1704 flow [2025-03-04 10:13:02,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1704, PETRI_PLACES=108, PETRI_TRANSITIONS=181} [2025-03-04 10:13:02,560 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 62 predicate places. [2025-03-04 10:13:02,560 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 181 transitions, 1704 flow [2025-03-04 10:13:02,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2025-03-04 10:13:02,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:02,560 INFO L206 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] [2025-03-04 10:13:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:13:02,560 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:13:02,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1296311656, now seen corresponding path program 1 times [2025-03-04 10:13:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:02,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650783885] [2025-03-04 10:13:02,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:02,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:13:02,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:02,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:02,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650783885] [2025-03-04 10:13:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650783885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194066337] [2025-03-04 10:13:02,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:02,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:02,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:02,622 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:02,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:13:02,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:13:02,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:02,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:02,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:02,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:13:02,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:02,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:02,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194066337] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:02,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:13:02,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-04 10:13:02,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058267761] [2025-03-04 10:13:02,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:02,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:02,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:02,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:02,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-04 10:13:02,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 181 transitions, 1704 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-03-04 10:13:02,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:02,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-04 10:13:02,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:03,804 INFO L124 PetriNetUnfolderBase]: 7351/10763 cut-off events. [2025-03-04 10:13:03,804 INFO L125 PetriNetUnfolderBase]: For 58005/58257 co-relation queries the response was YES. [2025-03-04 10:13:03,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49846 conditions, 10763 events. 7351/10763 cut-off events. For 58005/58257 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 60233 event pairs, 1602 based on Foata normal form. 440/11134 useless extension candidates. Maximal degree in co-relation 43596. Up to 5666 conditions per place. [2025-03-04 10:13:03,870 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 187 selfloop transitions, 12 changer transitions 0/232 dead transitions. [2025-03-04 10:13:03,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 232 transitions, 2601 flow [2025-03-04 10:13:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-04 10:13:03,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 10:13:03,872 INFO L175 Difference]: Start difference. First operand has 108 places, 181 transitions, 1704 flow. Second operand 5 states and 88 transitions. [2025-03-04 10:13:03,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 232 transitions, 2601 flow [2025-03-04 10:13:04,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 232 transitions, 2571 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-04 10:13:04,048 INFO L231 Difference]: Finished difference. Result has 112 places, 177 transitions, 1664 flow [2025-03-04 10:13:04,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1664, PETRI_PLACES=112, PETRI_TRANSITIONS=177} [2025-03-04 10:13:04,048 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 66 predicate places. [2025-03-04 10:13:04,048 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 177 transitions, 1664 flow [2025-03-04 10:13:04,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2025-03-04 10:13:04,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:04,048 INFO L206 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] [2025-03-04 10:13:04,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:13:04,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:13:04,249 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:13:04,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash -22179988, now seen corresponding path program 3 times [2025-03-04 10:13:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:04,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013380801] [2025-03-04 10:13:04,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:04,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-04 10:13:04,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 24 statements. [2025-03-04 10:13:04,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:04,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:04,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013380801] [2025-03-04 10:13:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013380801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:04,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520113435] [2025-03-04 10:13:04,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:04,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:04,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:04,304 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:04,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:13:04,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-04 10:13:04,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 24 statements. [2025-03-04 10:13:04,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:04,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:04,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:13:04,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:04,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:04,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520113435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:04,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:04,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:13:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456170226] [2025-03-04 10:13:04,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:04,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:13:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:04,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:13:04,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:13:04,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2025-03-04 10:13:04,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 177 transitions, 1664 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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) [2025-03-04 10:13:04,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:04,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2025-03-04 10:13:04,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:07,364 INFO L124 PetriNetUnfolderBase]: 19358/27321 cut-off events. [2025-03-04 10:13:07,364 INFO L125 PetriNetUnfolderBase]: For 145211/145211 co-relation queries the response was YES. [2025-03-04 10:13:07,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127744 conditions, 27321 events. 19358/27321 cut-off events. For 145211/145211 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 155717 event pairs, 1924 based on Foata normal form. 30/27351 useless extension candidates. Maximal degree in co-relation 116455. Up to 6194 conditions per place. [2025-03-04 10:13:07,621 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 578 selfloop transitions, 566 changer transitions 0/1145 dead transitions. [2025-03-04 10:13:07,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 1145 transitions, 12670 flow [2025-03-04 10:13:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 10:13:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-04 10:13:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 651 transitions. [2025-03-04 10:13:07,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38935406698564595 [2025-03-04 10:13:07,624 INFO L175 Difference]: Start difference. First operand has 112 places, 177 transitions, 1664 flow. Second operand 38 states and 651 transitions. [2025-03-04 10:13:07,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 1145 transitions, 12670 flow [2025-03-04 10:13:08,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 1145 transitions, 12181 flow, removed 60 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:08,742 INFO L231 Difference]: Finished difference. Result has 163 places, 706 transitions, 9145 flow [2025-03-04 10:13:08,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=9145, PETRI_PLACES=163, PETRI_TRANSITIONS=706} [2025-03-04 10:13:08,743 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 117 predicate places. [2025-03-04 10:13:08,743 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 706 transitions, 9145 flow [2025-03-04 10:13:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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) [2025-03-04 10:13:08,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:08,743 INFO L206 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] [2025-03-04 10:13:08,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:13:08,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:08,943 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:13:08,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1206173706, now seen corresponding path program 4 times [2025-03-04 10:13:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:08,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124994371] [2025-03-04 10:13:08,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:13:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:08,950 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:13:08,952 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-03-04 10:13:08,952 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:13:08,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:08,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124994371] [2025-03-04 10:13:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124994371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:08,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:08,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:13:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335872842] [2025-03-04 10:13:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:08,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:08,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:08,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:08,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:13:09,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2025-03-04 10:13:09,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 706 transitions, 9145 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2025-03-04 10:13:09,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:09,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2025-03-04 10:13:09,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:14,291 INFO L124 PetriNetUnfolderBase]: 28794/40274 cut-off events. [2025-03-04 10:13:14,291 INFO L125 PetriNetUnfolderBase]: For 303251/303251 co-relation queries the response was YES. [2025-03-04 10:13:14,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214173 conditions, 40274 events. 28794/40274 cut-off events. For 303251/303251 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 236375 event pairs, 2225 based on Foata normal form. 44/40318 useless extension candidates. Maximal degree in co-relation 199881. Up to 9771 conditions per place. [2025-03-04 10:13:14,898 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 738 selfloop transitions, 685 changer transitions 0/1424 dead transitions. [2025-03-04 10:13:14,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1424 transitions, 20129 flow [2025-03-04 10:13:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:13:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:13:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 324 transitions. [2025-03-04 10:13:14,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 10:13:14,899 INFO L175 Difference]: Start difference. First operand has 163 places, 706 transitions, 9145 flow. Second operand 18 states and 324 transitions. [2025-03-04 10:13:14,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1424 transitions, 20129 flow [2025-03-04 10:13:21,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1424 transitions, 18676 flow, removed 452 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:21,781 INFO L231 Difference]: Finished difference. Result has 192 places, 1083 transitions, 15202 flow [2025-03-04 10:13:21,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8427, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=331, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=15202, PETRI_PLACES=192, PETRI_TRANSITIONS=1083} [2025-03-04 10:13:21,782 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 146 predicate places. [2025-03-04 10:13:21,782 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 1083 transitions, 15202 flow [2025-03-04 10:13:21,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2025-03-04 10:13:21,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:21,782 INFO L206 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] [2025-03-04 10:13:21,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:13:21,782 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:13:21,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1822507668, now seen corresponding path program 5 times [2025-03-04 10:13:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480046483] [2025-03-04 10:13:21,783 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:13:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:21,788 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 3 equivalence classes. [2025-03-04 10:13:21,793 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:21,794 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:13:21,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480046483] [2025-03-04 10:13:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480046483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837625440] [2025-03-04 10:13:21,862 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:13:21,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:21,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:21,865 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:21,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:13:21,910 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 3 equivalence classes. [2025-03-04 10:13:21,926 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:21,927 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:13:21,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:21,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:13:21,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:21,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:22,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837625440] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:22,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:13:22,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-04 10:13:22,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729068344] [2025-03-04 10:13:22,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:22,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:22,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:22,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:22,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:13:22,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-03-04 10:13:22,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 1083 transitions, 15202 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) [2025-03-04 10:13:22,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:22,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-03-04 10:13:22,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:28,716 INFO L124 PetriNetUnfolderBase]: 27568/39741 cut-off events. [2025-03-04 10:13:28,716 INFO L125 PetriNetUnfolderBase]: For 353191/354046 co-relation queries the response was YES. [2025-03-04 10:13:29,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229420 conditions, 39741 events. 27568/39741 cut-off events. For 353191/354046 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 252227 event pairs, 3824 based on Foata normal form. 292/39779 useless extension candidates. Maximal degree in co-relation 220089. Up to 20080 conditions per place. [2025-03-04 10:13:29,520 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 853 selfloop transitions, 428 changer transitions 0/1318 dead transitions. [2025-03-04 10:13:29,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1318 transitions, 20676 flow [2025-03-04 10:13:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:13:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:13:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2025-03-04 10:13:29,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2025-03-04 10:13:29,521 INFO L175 Difference]: Start difference. First operand has 192 places, 1083 transitions, 15202 flow. Second operand 8 states and 150 transitions. [2025-03-04 10:13:29,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1318 transitions, 20676 flow [2025-03-04 10:13:37,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 1318 transitions, 19942 flow, removed 367 selfloop flow, removed 0 redundant places. [2025-03-04 10:13:37,404 INFO L231 Difference]: Finished difference. Result has 203 places, 1159 transitions, 17328 flow [2025-03-04 10:13:37,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14616, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1083, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17328, PETRI_PLACES=203, PETRI_TRANSITIONS=1159} [2025-03-04 10:13:37,405 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 157 predicate places. [2025-03-04 10:13:37,405 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 1159 transitions, 17328 flow [2025-03-04 10:13:37,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) [2025-03-04 10:13:37,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:37,405 INFO L206 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] [2025-03-04 10:13:37,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:13:37,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:13:37,606 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:13:37,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash -161537886, now seen corresponding path program 6 times [2025-03-04 10:13:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:37,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876434120] [2025-03-04 10:13:37,607 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:13:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:37,611 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 3 equivalence classes. [2025-03-04 10:13:37,614 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-03-04 10:13:37,614 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:13:37,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:37,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876434120] [2025-03-04 10:13:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876434120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:37,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:37,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:13:37,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434756095] [2025-03-04 10:13:37,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:37,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:37,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:37,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:37,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:13:37,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2025-03-04 10:13:37,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 1159 transitions, 17328 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2025-03-04 10:13:37,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:37,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2025-03-04 10:13:37,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:47,342 INFO L124 PetriNetUnfolderBase]: 37404/52453 cut-off events. [2025-03-04 10:13:47,342 INFO L125 PetriNetUnfolderBase]: For 506328/506328 co-relation queries the response was YES. [2025-03-04 10:13:48,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317152 conditions, 52453 events. 37404/52453 cut-off events. For 506328/506328 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 320299 event pairs, 3373 based on Foata normal form. 44/52497 useless extension candidates. Maximal degree in co-relation 308218. Up to 13757 conditions per place. [2025-03-04 10:13:48,548 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 775 selfloop transitions, 985 changer transitions 0/1761 dead transitions. [2025-03-04 10:13:48,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1761 transitions, 28324 flow [2025-03-04 10:13:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:13:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:13:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 367 transitions. [2025-03-04 10:13:48,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3971861471861472 [2025-03-04 10:13:48,550 INFO L175 Difference]: Start difference. First operand has 203 places, 1159 transitions, 17328 flow. Second operand 21 states and 367 transitions. [2025-03-04 10:13:48,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 1761 transitions, 28324 flow [2025-03-04 10:13:59,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1761 transitions, 27945 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:59,574 INFO L231 Difference]: Finished difference. Result has 232 places, 1488 transitions, 25773 flow [2025-03-04 10:13:59,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=17076, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=658, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=25773, PETRI_PLACES=232, PETRI_TRANSITIONS=1488} [2025-03-04 10:13:59,575 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 186 predicate places. [2025-03-04 10:13:59,575 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 1488 transitions, 25773 flow [2025-03-04 10:13:59,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2025-03-04 10:13:59,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:59,575 INFO L206 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] [2025-03-04 10:13:59,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:13:59,575 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 10:13:59,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2099903744, now seen corresponding path program 7 times [2025-03-04 10:13:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:59,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954219515] [2025-03-04 10:13:59,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:13:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:59,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:13:59,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:59,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:59,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:59,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:59,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954219515] [2025-03-04 10:13:59,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954219515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000921248] [2025-03-04 10:13:59,650 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:13:59,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:59,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:59,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:59,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:13:59,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:13:59,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:59,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:59,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:59,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:13:59,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:59,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000921248] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:13:59,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 16 [2025-03-04 10:13:59,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926574733] [2025-03-04 10:13:59,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:13:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:59,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:13:59,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:13:59,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-03-04 10:13:59,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 1488 transitions, 25773 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) [2025-03-04 10:13:59,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:59,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-03-04 10:13:59,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand