./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/chl-name-comparator-trans.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 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:20:13,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:20:13,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:20:13,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:20:13,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:20:13,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:20:13,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:20:13,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:20:13,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:20:13,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:20:13,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:20:13,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:20:13,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:20:13,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:20:13,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:20:13,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:20:13,951 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:20:13,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:20:13,953 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:13,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:20:13,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:20:13,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:20:13,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:20:13,954 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 -> 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 [2025-03-09 01:20:14,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:20:14,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:20:14,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:20:14,201 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:20:14,201 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:20:14,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-03-09 01:20:15,332 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee87801b/8eb913189e8c4abf80ee9724f405cff9/FLAGa32758463 [2025-03-09 01:20:15,545 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:20:15,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-03-09 01:20:15,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee87801b/8eb913189e8c4abf80ee9724f405cff9/FLAGa32758463 [2025-03-09 01:20:15,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee87801b/8eb913189e8c4abf80ee9724f405cff9 [2025-03-09 01:20:15,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:20:15,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:20:15,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:15,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:20:15,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:20:15,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6401f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15, skipping insertion in model container [2025-03-09 01:20:15,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:20:15,739 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-09 01:20:15,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:15,750 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:20:15,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:15,793 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:20:15,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15 WrapperNode [2025-03-09 01:20:15,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:15,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:15,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:20:15,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:20:15,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,822 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 300 [2025-03-09 01:20:15,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:15,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:20:15,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:20:15,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:20:15,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,841 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-09 01:20:15,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,847 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:20:15,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:20:15,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:20:15,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:20:15,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (1/1) ... [2025-03-09 01:20:15,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:15,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:15,875 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-09 01:20:15,879 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-09 01:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:20:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:20:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:20:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:20:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:20:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:20:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:20:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:20:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:20:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:20:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:20:15,897 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:20:15,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:20:15,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:20:16,375 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:20:16,375 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:20:16,645 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:20:16,646 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:20:16,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:16 BoogieIcfgContainer [2025-03-09 01:20:16,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:20:16,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:20:16,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:20:16,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:20:16,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:20:15" (1/3) ... [2025-03-09 01:20:16,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f2678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:16, skipping insertion in model container [2025-03-09 01:20:16,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:15" (2/3) ... [2025-03-09 01:20:16,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f2678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:16, skipping insertion in model container [2025-03-09 01:20:16,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:16" (3/3) ... [2025-03-09 01:20:16,654 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2025-03-09 01:20:16,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:20:16,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-trans.wvr.c that has 4 procedures, 44 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-09 01:20:16,667 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:20:16,728 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:20:16,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 121 flow [2025-03-09 01:20:16,782 INFO L124 PetriNetUnfolderBase]: 7/47 cut-off events. [2025-03-09 01:20:16,784 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:20:16,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 7/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-09 01:20:16,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 50 transitions, 121 flow [2025-03-09 01:20:16,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 46 transitions, 110 flow [2025-03-09 01:20:16,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:20:16,810 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;@a920ad1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:20:16,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-09 01:20:16,814 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:20:16,815 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:20:16,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:20:16,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:16,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:16,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:16,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash 799859, now seen corresponding path program 1 times [2025-03-09 01:20:16,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732017236] [2025-03-09 01:20:16,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:16,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:16,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:16,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:16,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,057 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-09 01:20:17,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:17,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732017236] [2025-03-09 01:20:17,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732017236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:17,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:17,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:20:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526085854] [2025-03-09 01:20:17,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:17,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:17,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:17,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:17,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:17,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-09 01:20:17,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-09 01:20:17,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:17,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-09 01:20:17,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:17,412 INFO L124 PetriNetUnfolderBase]: 1316/2103 cut-off events. [2025-03-09 01:20:17,412 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-09 01:20:17,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4116 conditions, 2103 events. 1316/2103 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10097 event pairs, 1060 based on Foata normal form. 1/1737 useless extension candidates. Maximal degree in co-relation 3810. Up to 1877 conditions per place. [2025-03-09 01:20:17,434 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 30 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2025-03-09 01:20:17,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 162 flow [2025-03-09 01:20:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-09 01:20:17,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2025-03-09 01:20:17,444 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 110 flow. Second operand 3 states and 73 transitions. [2025-03-09 01:20:17,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 162 flow [2025-03-09 01:20:17,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 150 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:17,453 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 90 flow [2025-03-09 01:20:17,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-03-09 01:20:17,458 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2025-03-09 01:20:17,458 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 90 flow [2025-03-09 01:20:17,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-09 01:20:17,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:17,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:17,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:20:17,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:17,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash 799860, now seen corresponding path program 1 times [2025-03-09 01:20:17,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:17,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014148068] [2025-03-09 01:20:17,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:17,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:17,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:17,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:17,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:17,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,668 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-09 01:20:17,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:17,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014148068] [2025-03-09 01:20:17,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014148068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:17,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499866012] [2025-03-09 01:20:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:17,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:17,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:17,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:17,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-09 01:20:17,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-09 01:20:17,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:17,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-09 01:20:17,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:17,956 INFO L124 PetriNetUnfolderBase]: 1316/2105 cut-off events. [2025-03-09 01:20:17,956 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-09 01:20:17,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4035 conditions, 2105 events. 1316/2105 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10101 event pairs, 1060 based on Foata normal form. 1/1739 useless extension candidates. Maximal degree in co-relation 4016. Up to 1881 conditions per place. [2025-03-09 01:20:17,967 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 33 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-09 01:20:17,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 164 flow [2025-03-09 01:20:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-09 01:20:17,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2025-03-09 01:20:17,968 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 90 flow. Second operand 3 states and 73 transitions. [2025-03-09 01:20:17,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 164 flow [2025-03-09 01:20:17,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:17,970 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 100 flow [2025-03-09 01:20:17,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-03-09 01:20:17,970 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2025-03-09 01:20:17,971 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 100 flow [2025-03-09 01:20:17,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-09 01:20:17,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:17,971 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:20:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:20:17,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:17,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash 768691715, now seen corresponding path program 1 times [2025-03-09 01:20:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920366421] [2025-03-09 01:20:17,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:17,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:17,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:18,241 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-09 01:20:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920366421] [2025-03-09 01:20:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920366421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328880592] [2025-03-09 01:20:18,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:18,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:18,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:18,244 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-09 01:20:18,246 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-09 01:20:18,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:18,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:18,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:18,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:18,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:20:18,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:18,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:18,381 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-09 01:20:18,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:18,431 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-09 01:20:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328880592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:18,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-09 01:20:18,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546037372] [2025-03-09 01:20:18,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:18,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:20:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:18,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:20:18,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:20:18,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-09 01:20:18,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 100 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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-09 01:20:18,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:18,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-09 01:20:18,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:18,755 INFO L124 PetriNetUnfolderBase]: 1317/2110 cut-off events. [2025-03-09 01:20:18,755 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-09 01:20:18,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4053 conditions, 2110 events. 1317/2110 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10120 event pairs, 1060 based on Foata normal form. 1/1744 useless extension candidates. Maximal degree in co-relation 4040. Up to 1882 conditions per place. [2025-03-09 01:20:18,767 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 35 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2025-03-09 01:20:18,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 198 flow [2025-03-09 01:20:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-09 01:20:18,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.412 [2025-03-09 01:20:18,769 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 100 flow. Second operand 5 states and 103 transitions. [2025-03-09 01:20:18,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 198 flow [2025-03-09 01:20:18,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:18,771 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 135 flow [2025-03-09 01:20:18,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-03-09 01:20:18,771 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2025-03-09 01:20:18,772 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 135 flow [2025-03-09 01:20:18,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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-09 01:20:18,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:18,772 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1] [2025-03-09 01:20:18,779 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-09 01:20:18,977 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-09 01:20:18,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:18,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 707131873, now seen corresponding path program 2 times [2025-03-09 01:20:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:18,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215581793] [2025-03-09 01:20:18,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:18,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 01:20:19,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:19,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:19,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:19,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215581793] [2025-03-09 01:20:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215581793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798204859] [2025-03-09 01:20:19,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:19,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:19,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:19,087 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-09 01:20:19,088 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-09 01:20:19,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 01:20:19,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:19,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:19,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:20:19,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:19,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798204859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 01:20:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669338163] [2025-03-09 01:20:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:19,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:19,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:19,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-09 01:20:19,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-09 01:20:19,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:19,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-09 01:20:19,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:19,397 INFO L124 PetriNetUnfolderBase]: 1316/2107 cut-off events. [2025-03-09 01:20:19,397 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-09 01:20:19,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 2107 events. 1316/2107 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10088 event pairs, 1060 based on Foata normal form. 1/1742 useless extension candidates. Maximal degree in co-relation 4028. Up to 1878 conditions per place. [2025-03-09 01:20:19,406 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 31 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2025-03-09 01:20:19,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 199 flow [2025-03-09 01:20:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-03-09 01:20:19,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2025-03-09 01:20:19,409 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 135 flow. Second operand 6 states and 116 transitions. [2025-03-09 01:20:19,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 199 flow [2025-03-09 01:20:19,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 188 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:19,410 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 126 flow [2025-03-09 01:20:19,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2025-03-09 01:20:19,411 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-03-09 01:20:19,411 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 126 flow [2025-03-09 01:20:19,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-09 01:20:19,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:19,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:19,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:19,613 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,SelfDestructingSolverStorable3 [2025-03-09 01:20:19,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:19,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1026702347, now seen corresponding path program 1 times [2025-03-09 01:20:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:19,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812493318] [2025-03-09 01:20:19,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:20:19,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:20:19,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:19,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:19,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812493318] [2025-03-09 01:20:19,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812493318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:19,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154153224] [2025-03-09 01:20:19,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:19,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:19,698 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-09 01:20:19,700 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-09 01:20:19,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:20:19,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:20:19,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:20:19,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:19,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:19,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154153224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:19,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:19,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-09 01:20:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695781582] [2025-03-09 01:20:19,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:19,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:20:19,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:19,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:20:19,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:20:19,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-09 01:20:19,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 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-09 01:20:19,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:19,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-09 01:20:19,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:20,003 INFO L124 PetriNetUnfolderBase]: 1315/2106 cut-off events. [2025-03-09 01:20:20,004 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-09 01:20:20,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 2106 events. 1315/2106 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10075 event pairs, 1060 based on Foata normal form. 1/1741 useless extension candidates. Maximal degree in co-relation 4016. Up to 1878 conditions per place. [2025-03-09 01:20:20,016 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 32 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2025-03-09 01:20:20,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 200 flow [2025-03-09 01:20:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-03-09 01:20:20,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.408 [2025-03-09 01:20:20,018 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 126 flow. Second operand 5 states and 102 transitions. [2025-03-09 01:20:20,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 200 flow [2025-03-09 01:20:20,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 180 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:20,021 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 108 flow [2025-03-09 01:20:20,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-09 01:20:20,022 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2025-03-09 01:20:20,022 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 108 flow [2025-03-09 01:20:20,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 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-09 01:20:20,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:20,023 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:20,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:20:20,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:20,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:20,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1460164250, now seen corresponding path program 2 times [2025-03-09 01:20:20,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:20,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575479282] [2025-03-09 01:20:20,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:20,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:20:20,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 13 statements. [2025-03-09 01:20:20,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:20,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575479282] [2025-03-09 01:20:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575479282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:20,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:20,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:20,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872148367] [2025-03-09 01:20:20,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:20,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:20,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:20,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-09 01:20:20,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-09 01:20:20,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:20,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-09 01:20:20,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:20,682 INFO L124 PetriNetUnfolderBase]: 2629/4081 cut-off events. [2025-03-09 01:20:20,682 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-09 01:20:20,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7939 conditions, 4081 events. 2629/4081 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21542 event pairs, 1240 based on Foata normal form. 0/3383 useless extension candidates. Maximal degree in co-relation 7910. Up to 2168 conditions per place. [2025-03-09 01:20:20,723 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 57 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-03-09 01:20:20,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 287 flow [2025-03-09 01:20:20,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-03-09 01:20:20,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-09 01:20:20,728 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 108 flow. Second operand 5 states and 120 transitions. [2025-03-09 01:20:20,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 287 flow [2025-03-09 01:20:20,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 279 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:20,729 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 116 flow [2025-03-09 01:20:20,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, 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=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-03-09 01:20:20,730 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-03-09 01:20:20,730 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 116 flow [2025-03-09 01:20:20,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-09 01:20:20,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:20,730 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:20,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:20:20,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1460164249, now seen corresponding path program 1 times [2025-03-09 01:20:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257572645] [2025-03-09 01:20:20,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:20,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:20:20,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:20:20,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:20,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:20,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257572645] [2025-03-09 01:20:20,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257572645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721927723] [2025-03-09 01:20:20,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:20,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:20,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:20,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:20,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:20,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:20:20,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-09 01:20:20,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:20,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:20:20,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:21,052 INFO L124 PetriNetUnfolderBase]: 2423/3671 cut-off events. [2025-03-09 01:20:21,052 INFO L125 PetriNetUnfolderBase]: For 485/561 co-relation queries the response was YES. [2025-03-09 01:20:21,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7579 conditions, 3671 events. 2423/3671 cut-off events. For 485/561 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17419 event pairs, 2025 based on Foata normal form. 172/3359 useless extension candidates. Maximal degree in co-relation 7548. Up to 3458 conditions per place. [2025-03-09 01:20:21,064 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 33 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-09 01:20:21,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2025-03-09 01:20:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-09 01:20:21,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.355 [2025-03-09 01:20:21,067 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 116 flow. Second operand 4 states and 71 transitions. [2025-03-09 01:20:21,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2025-03-09 01:20:21,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:21,068 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 108 flow [2025-03-09 01:20:21,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-03-09 01:20:21,069 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-03-09 01:20:21,069 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 108 flow [2025-03-09 01:20:21,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-09 01:20:21,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:21,069 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:21,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:20:21,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:21,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2013917262, now seen corresponding path program 1 times [2025-03-09 01:20:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:21,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657573520] [2025-03-09 01:20:21,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:21,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:20:21,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:20:21,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:21,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:21,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657573520] [2025-03-09 01:20:21,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657573520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:21,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097901007] [2025-03-09 01:20:21,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:21,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:21,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:21,289 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-09 01:20:21,290 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-09 01:20:21,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:20:21,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:20:21,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:21,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:20:21,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:21,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:21,536 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-09 01:20:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:21,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097901007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:21,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:21,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2025-03-09 01:20:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417632927] [2025-03-09 01:20:21,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:21,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:20:21,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:21,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:20:21,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:20:21,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-09 01:20:21,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 108 flow. Second operand has 17 states, 17 states have (on average 14.470588235294118) internal successors, (246), 17 states have internal predecessors, (246), 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-09 01:20:21,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:21,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-09 01:20:21,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:22,573 INFO L124 PetriNetUnfolderBase]: 6825/9783 cut-off events. [2025-03-09 01:20:22,574 INFO L125 PetriNetUnfolderBase]: For 905/1130 co-relation queries the response was YES. [2025-03-09 01:20:22,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20450 conditions, 9783 events. 6825/9783 cut-off events. For 905/1130 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 49387 event pairs, 2385 based on Foata normal form. 0/8225 useless extension candidates. Maximal degree in co-relation 20419. Up to 4022 conditions per place. [2025-03-09 01:20:22,607 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 81 selfloop transitions, 7 changer transitions 0/91 dead transitions. [2025-03-09 01:20:22,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 91 transitions, 412 flow [2025-03-09 01:20:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:20:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:20:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-09 01:20:22,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4575 [2025-03-09 01:20:22,608 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 108 flow. Second operand 8 states and 183 transitions. [2025-03-09 01:20:22,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 91 transitions, 412 flow [2025-03-09 01:20:22,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 91 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:22,610 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 133 flow [2025-03-09 01:20:22,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-03-09 01:20:22,610 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2025-03-09 01:20:22,610 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 133 flow [2025-03-09 01:20:22,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.470588235294118) internal successors, (246), 17 states have internal predecessors, (246), 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-09 01:20:22,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:22,611 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:22,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:20:22,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:22,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 325221158, now seen corresponding path program 1 times [2025-03-09 01:20:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785919566] [2025-03-09 01:20:22,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:22,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:22,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:22,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:22,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:23,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:23,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785919566] [2025-03-09 01:20:23,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785919566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:23,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864497817] [2025-03-09 01:20:23,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:23,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:23,003 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-09 01:20:23,004 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-09 01:20:23,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:23,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:23,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:20:23,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:23,076 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-09 01:20:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:23,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:23,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864497817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:23,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:23,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2025-03-09 01:20:23,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247126189] [2025-03-09 01:20:23,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:23,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:20:23,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:23,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:20:23,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:20:23,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-09 01:20:23,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 133 flow. Second operand has 21 states, 21 states have (on average 13.142857142857142) internal successors, (276), 21 states have internal predecessors, (276), 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-09 01:20:23,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:23,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-09 01:20:23,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:25,055 INFO L124 PetriNetUnfolderBase]: 12853/18397 cut-off events. [2025-03-09 01:20:25,055 INFO L125 PetriNetUnfolderBase]: For 2855/2855 co-relation queries the response was YES. [2025-03-09 01:20:25,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40509 conditions, 18397 events. 12853/18397 cut-off events. For 2855/2855 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 101227 event pairs, 3460 based on Foata normal form. 0/15491 useless extension candidates. Maximal degree in co-relation 40473. Up to 5736 conditions per place. [2025-03-09 01:20:25,122 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 115 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2025-03-09 01:20:25,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 126 transitions, 608 flow [2025-03-09 01:20:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2025-03-09 01:20:25,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-09 01:20:25,124 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 133 flow. Second operand 9 states and 216 transitions. [2025-03-09 01:20:25,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 126 transitions, 608 flow [2025-03-09 01:20:25,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 601 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:25,131 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 160 flow [2025-03-09 01:20:25,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=160, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2025-03-09 01:20:25,132 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2025-03-09 01:20:25,132 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 160 flow [2025-03-09 01:20:25,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.142857142857142) internal successors, (276), 21 states have internal predecessors, (276), 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-09 01:20:25,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:25,132 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:25,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:20:25,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:25,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:25,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash 558768016, now seen corresponding path program 1 times [2025-03-09 01:20:25,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603809198] [2025-03-09 01:20:25,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:25,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:25,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:25,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:25,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:25,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:25,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603809198] [2025-03-09 01:20:25,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603809198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:25,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315474145] [2025-03-09 01:20:25,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:25,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:25,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:25,552 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-09 01:20:25,553 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-09 01:20:25,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:25,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:25,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:25,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:25,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:20:25,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:25,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:25,779 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-09 01:20:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:25,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315474145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:25,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:25,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2025-03-09 01:20:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89343173] [2025-03-09 01:20:25,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:25,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:20:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:25,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:20:25,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:20:26,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-09 01:20:26,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 160 flow. Second operand has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 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-09 01:20:26,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:26,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-09 01:20:26,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:28,962 INFO L124 PetriNetUnfolderBase]: 32327/46067 cut-off events. [2025-03-09 01:20:28,963 INFO L125 PetriNetUnfolderBase]: For 19731/20147 co-relation queries the response was YES. [2025-03-09 01:20:29,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104651 conditions, 46067 events. 32327/46067 cut-off events. For 19731/20147 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 276522 event pairs, 12757 based on Foata normal form. 0/38291 useless extension candidates. Maximal degree in co-relation 104612. Up to 20102 conditions per place. [2025-03-09 01:20:29,170 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 89 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2025-03-09 01:20:29,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 546 flow [2025-03-09 01:20:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:20:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:20:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2025-03-09 01:20:29,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4475 [2025-03-09 01:20:29,175 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 160 flow. Second operand 8 states and 179 transitions. [2025-03-09 01:20:29,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 546 flow [2025-03-09 01:20:29,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 521 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:29,184 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 175 flow [2025-03-09 01:20:29,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-09 01:20:29,186 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-03-09 01:20:29,186 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 175 flow [2025-03-09 01:20:29,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 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-09 01:20:29,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:29,187 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:29,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:20:29,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:29,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:29,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1121496466, now seen corresponding path program 1 times [2025-03-09 01:20:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555728627] [2025-03-09 01:20:29,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:29,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:20:29,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:20:29,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555728627] [2025-03-09 01:20:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555728627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598692667] [2025-03-09 01:20:29,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:29,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:29,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:29,615 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-09 01:20:29,617 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-09 01:20:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:20:29,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:20:29,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:29,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:20:29,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:29,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:29,939 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-09 01:20:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598692667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:29,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:29,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2025-03-09 01:20:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290140766] [2025-03-09 01:20:29,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:29,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:20:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:29,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:20:29,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:20:30,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-09 01:20:30,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 175 flow. Second operand has 24 states, 24 states have (on average 14.5) internal successors, (348), 24 states have internal predecessors, (348), 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-09 01:20:30,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:30,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-09 01:20:30,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:34,677 INFO L124 PetriNetUnfolderBase]: 41923/59631 cut-off events. [2025-03-09 01:20:34,677 INFO L125 PetriNetUnfolderBase]: For 23790/24462 co-relation queries the response was YES. [2025-03-09 01:20:34,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139836 conditions, 59631 events. 41923/59631 cut-off events. For 23790/24462 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 371863 event pairs, 12007 based on Foata normal form. 778/51213 useless extension candidates. Maximal degree in co-relation 139794. Up to 18928 conditions per place. [2025-03-09 01:20:34,933 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 121 selfloop transitions, 8 changer transitions 0/132 dead transitions. [2025-03-09 01:20:34,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 132 transitions, 715 flow [2025-03-09 01:20:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2025-03-09 01:20:34,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48444444444444446 [2025-03-09 01:20:34,934 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 175 flow. Second operand 9 states and 218 transitions. [2025-03-09 01:20:34,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 132 transitions, 715 flow [2025-03-09 01:20:35,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 132 transitions, 708 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:35,033 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 194 flow [2025-03-09 01:20:35,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=194, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2025-03-09 01:20:35,034 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2025-03-09 01:20:35,034 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 194 flow [2025-03-09 01:20:35,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.5) internal successors, (348), 24 states have internal predecessors, (348), 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-09 01:20:35,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:35,035 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-09 01:20:35,040 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-09 01:20:35,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:35,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:35,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:35,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1333983578, now seen corresponding path program 2 times [2025-03-09 01:20:35,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:35,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315508873] [2025-03-09 01:20:35,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:35,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:35,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:20:35,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:20:35,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:35,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:35,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:35,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315508873] [2025-03-09 01:20:35,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315508873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:35,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899807830] [2025-03-09 01:20:35,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:35,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:35,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:35,475 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-09 01:20:35,481 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-09 01:20:35,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:20:35,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:20:35,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:35,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:35,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:20:35,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:35,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899807830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:35,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:35,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-03-09 01:20:35,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550219409] [2025-03-09 01:20:35,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:35,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:35,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:35,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:20:35,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-09 01:20:35,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-09 01:20:35,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:35,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-09 01:20:35,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:39,241 INFO L124 PetriNetUnfolderBase]: 37549/53687 cut-off events. [2025-03-09 01:20:39,241 INFO L125 PetriNetUnfolderBase]: For 29516/30192 co-relation queries the response was YES. [2025-03-09 01:20:39,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128219 conditions, 53687 events. 37549/53687 cut-off events. For 29516/30192 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 341322 event pairs, 975 based on Foata normal form. 0/45743 useless extension candidates. Maximal degree in co-relation 128175. Up to 13570 conditions per place. [2025-03-09 01:20:39,549 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 148 selfloop transitions, 4 changer transitions 0/155 dead transitions. [2025-03-09 01:20:39,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 155 transitions, 875 flow [2025-03-09 01:20:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-03-09 01:20:39,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-09 01:20:39,550 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 194 flow. Second operand 6 states and 204 transitions. [2025-03-09 01:20:39,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 155 transitions, 875 flow [2025-03-09 01:20:39,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 155 transitions, 818 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-03-09 01:20:39,724 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 166 flow [2025-03-09 01:20:39,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2025-03-09 01:20:39,725 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-09 01:20:39,725 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 166 flow [2025-03-09 01:20:39,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-09 01:20:39,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:39,725 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:39,732 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-09 01:20:39,925 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,SelfDestructingSolverStorable11 [2025-03-09 01:20:39,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:39,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash -416314800, now seen corresponding path program 1 times [2025-03-09 01:20:39,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:39,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714375169] [2025-03-09 01:20:39,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:39,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:20:39,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:20:39,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:39,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:40,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:40,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714375169] [2025-03-09 01:20:40,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714375169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:40,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217189838] [2025-03-09 01:20:40,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:40,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:40,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:40,130 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-09 01:20:40,132 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-09 01:20:40,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:20:40,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:20:40,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:40,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:40,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:20:40,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:40,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:40,467 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-09 01:20:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:40,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217189838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:40,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2025-03-09 01:20:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143277517] [2025-03-09 01:20:40,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:40,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:20:40,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:40,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:20:40,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:20:40,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-09 01:20:40,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 166 flow. Second operand has 24 states, 24 states have (on average 14.75) internal successors, (354), 24 states have internal predecessors, (354), 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-09 01:20:40,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:40,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-09 01:20:40,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:45,729 INFO L124 PetriNetUnfolderBase]: 51001/72889 cut-off events. [2025-03-09 01:20:45,729 INFO L125 PetriNetUnfolderBase]: For 36499/37335 co-relation queries the response was YES. [2025-03-09 01:20:45,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173644 conditions, 72889 events. 51001/72889 cut-off events. For 36499/37335 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 458906 event pairs, 16083 based on Foata normal form. 940/66037 useless extension candidates. Maximal degree in co-relation 173607. Up to 24864 conditions per place. [2025-03-09 01:20:46,150 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 115 selfloop transitions, 8 changer transitions 0/125 dead transitions. [2025-03-09 01:20:46,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 125 transitions, 694 flow [2025-03-09 01:20:46,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2025-03-09 01:20:46,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4711111111111111 [2025-03-09 01:20:46,151 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 166 flow. Second operand 9 states and 212 transitions. [2025-03-09 01:20:46,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 125 transitions, 694 flow [2025-03-09 01:20:46,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 125 transitions, 666 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:46,318 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 185 flow [2025-03-09 01:20:46,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=185, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2025-03-09 01:20:46,319 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2025-03-09 01:20:46,319 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 185 flow [2025-03-09 01:20:46,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.75) internal successors, (354), 24 states have internal predecessors, (354), 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-09 01:20:46,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:46,319 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:46,325 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-09 01:20:46,519 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,SelfDestructingSolverStorable12 [2025-03-09 01:20:46,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:20:46,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash -48544745, now seen corresponding path program 2 times [2025-03-09 01:20:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253115551] [2025-03-09 01:20:46,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:46,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:20:46,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:20:46,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:46,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:46,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253115551] [2025-03-09 01:20:46,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253115551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402756265] [2025-03-09 01:20:46,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:46,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:46,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:46,710 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-09 01:20:46,711 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-09 01:20:46,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:20:46,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:20:46,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:46,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:46,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:20:46,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:46,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402756265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:46,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-03-09 01:20:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820857721] [2025-03-09 01:20:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:46,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:46,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:46,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:20:46,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-09 01:20:46,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-09 01:20:46,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:46,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-09 01:20:46,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand