./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-lamport.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/parallel-lamport.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 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:22:04,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:22:04,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:22:04,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:22:04,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:22:04,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:22:04,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:22:04,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:22:04,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:22:04,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:22:04,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:22:04,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:22:04,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:22:04,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:22:04,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:22:04,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:22:04,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:22:04,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:22:04,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:22:04,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:22:04,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:22:04,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:22:04,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:22:04,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:22:04,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:22:04,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:22:04,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:22:04,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:22:04,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:22:04,854 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 -> 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 [2025-03-09 01:22:05,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:22:05,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:22:05,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:22:05,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:22:05,073 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:22:05,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-03-09 01:22:06,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39eb300a6/e1de075763434d90b9f8f4b327e5b187/FLAGb14d910fa [2025-03-09 01:22:06,437 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:22:06,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-03-09 01:22:06,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39eb300a6/e1de075763434d90b9f8f4b327e5b187/FLAGb14d910fa [2025-03-09 01:22:06,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39eb300a6/e1de075763434d90b9f8f4b327e5b187 [2025-03-09 01:22:06,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:22:06,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:22:06,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:22:06,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:22:06,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:22:06,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28213580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06, skipping insertion in model container [2025-03-09 01:22:06,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:22:06,618 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:22:06,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:22:06,631 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:22:06,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:22:06,666 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:22:06,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06 WrapperNode [2025-03-09 01:22:06,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:22:06,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:22:06,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:22:06,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:22:06,672 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:22:06" (1/1) ... [2025-03-09 01:22:06,680 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:22:06" (1/1) ... [2025-03-09 01:22:06,702 INFO L138 Inliner]: procedures = 22, calls = 30, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 206 [2025-03-09 01:22:06,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:22:06,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:22:06,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:22:06,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:22:06,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,734 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:22:06,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:22:06,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:22:06,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:22:06,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:22:06,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (1/1) ... [2025-03-09 01:22:06,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:22:06,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:06,776 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:22:06,777 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:22:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:22:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:22:06,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:22:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:22:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:22:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:22:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:22:06,795 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:22:06,887 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:22:06,888 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:22:07,210 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:22:07,211 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:22:07,405 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:22:07,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:22:07,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:22:07 BoogieIcfgContainer [2025-03-09 01:22:07,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:22:07,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:22:07,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:22:07,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:22:07,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:22:06" (1/3) ... [2025-03-09 01:22:07,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c67111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:22:07, skipping insertion in model container [2025-03-09 01:22:07,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:06" (2/3) ... [2025-03-09 01:22:07,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c67111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:22:07, skipping insertion in model container [2025-03-09 01:22:07,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:22:07" (3/3) ... [2025-03-09 01:22:07,418 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2025-03-09 01:22:07,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:22:07,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-lamport.wvr.c that has 4 procedures, 75 locations, 1 initial locations, 1 loop locations, and 12 error locations. [2025-03-09 01:22:07,438 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:22:07,509 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:22:07,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 75 transitions, 171 flow [2025-03-09 01:22:07,573 INFO L124 PetriNetUnfolderBase]: 1/72 cut-off events. [2025-03-09 01:22:07,577 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:22:07,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 72 events. 1/72 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 122 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-09 01:22:07,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 75 transitions, 171 flow [2025-03-09 01:22:07,583 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 71 transitions, 160 flow [2025-03-09 01:22:07,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:22:07,600 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;@3fca37af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:22:07,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-09 01:22:07,609 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:22:07,610 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2025-03-09 01:22:07,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:22:07,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:07,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:07,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:07,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1046519274, now seen corresponding path program 1 times [2025-03-09 01:22:07,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:07,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479928945] [2025-03-09 01:22:07,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:07,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:22:07,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:22:07,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:07,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:07,817 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:22:07,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:07,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479928945] [2025-03-09 01:22:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479928945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:07,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:22:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835074881] [2025-03-09 01:22:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:07,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:07,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:07,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:07,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:07,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-09 01:22:07,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:22:07,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:07,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-09 01:22:07,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:08,431 INFO L124 PetriNetUnfolderBase]: 2569/4391 cut-off events. [2025-03-09 01:22:08,432 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2025-03-09 01:22:08,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8538 conditions, 4391 events. 2569/4391 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 26997 event pairs, 2568 based on Foata normal form. 1/4005 useless extension candidates. Maximal degree in co-relation 8141. Up to 3862 conditions per place. [2025-03-09 01:22:08,494 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 49 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-09 01:22:08,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 68 transitions, 256 flow [2025-03-09 01:22:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-09 01:22:08,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2025-03-09 01:22:08,509 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 160 flow. Second operand 3 states and 116 transitions. [2025-03-09 01:22:08,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 68 transitions, 256 flow [2025-03-09 01:22:08,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 244 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:22:08,520 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 146 flow [2025-03-09 01:22:08,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-03-09 01:22:08,526 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -7 predicate places. [2025-03-09 01:22:08,527 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 146 flow [2025-03-09 01:22:08,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:22:08,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:08,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:08,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:22:08,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:08,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1046519275, now seen corresponding path program 1 times [2025-03-09 01:22:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031268827] [2025-03-09 01:22:08,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:08,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:22:08,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:22:08,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:08,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:08,836 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:22:08,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:08,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031268827] [2025-03-09 01:22:08,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031268827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:08,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:08,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:22:08,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843837424] [2025-03-09 01:22:08,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:08,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:22:08,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:08,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:22:08,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:22:08,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-09 01:22:08,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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:22:08,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:08,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-09 01:22:08,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:09,446 INFO L124 PetriNetUnfolderBase]: 2570/4394 cut-off events. [2025-03-09 01:22:09,447 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 01:22:09,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8379 conditions, 4394 events. 2570/4394 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 27034 event pairs, 2568 based on Foata normal form. 0/4007 useless extension candidates. Maximal degree in co-relation 8337. Up to 3864 conditions per place. [2025-03-09 01:22:09,479 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 49 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-09 01:22:09,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 264 flow [2025-03-09 01:22:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:22:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:22:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2025-03-09 01:22:09,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40444444444444444 [2025-03-09 01:22:09,482 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 146 flow. Second operand 6 states and 182 transitions. [2025-03-09 01:22:09,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 264 flow [2025-03-09 01:22:09,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:09,488 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 173 flow [2025-03-09 01:22:09,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-03-09 01:22:09,490 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2025-03-09 01:22:09,490 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 173 flow [2025-03-09 01:22:09,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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:22:09,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:09,490 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:09,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:22:09,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:09,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash 682694693, now seen corresponding path program 1 times [2025-03-09 01:22:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:09,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533176893] [2025-03-09 01:22:09,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:09,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:22:09,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:22:09,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:09,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:09,807 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:22:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533176893] [2025-03-09 01:22:09,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533176893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133749424] [2025-03-09 01:22:09,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:09,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:09,811 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:22:09,812 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:22:09,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:22:09,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:22:09,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:09,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:09,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:22:09,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:09,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:22:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:10,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:10,388 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:22:10,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133749424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:10,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:10,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 01:22:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270451968] [2025-03-09 01:22:10,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:10,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:22:10,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:10,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:22:10,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:22:10,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-09 01:22:10,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 173 flow. Second operand has 15 states, 15 states have (on average 22.8) internal successors, (342), 15 states have internal predecessors, (342), 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:22:10,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:10,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-09 01:22:10,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:11,326 INFO L124 PetriNetUnfolderBase]: 2570/4393 cut-off events. [2025-03-09 01:22:11,326 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-09 01:22:11,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8388 conditions, 4393 events. 2570/4393 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 26998 event pairs, 2568 based on Foata normal form. 0/4006 useless extension candidates. Maximal degree in co-relation 8366. Up to 3860 conditions per place. [2025-03-09 01:22:11,349 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 45 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2025-03-09 01:22:11,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 70 transitions, 277 flow [2025-03-09 01:22:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:22:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:22:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2025-03-09 01:22:11,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37166666666666665 [2025-03-09 01:22:11,356 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 173 flow. Second operand 8 states and 223 transitions. [2025-03-09 01:22:11,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 70 transitions, 277 flow [2025-03-09 01:22:11,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:22:11,358 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 180 flow [2025-03-09 01:22:11,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=180, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2025-03-09 01:22:11,359 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 1 predicate places. [2025-03-09 01:22:11,359 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 180 flow [2025-03-09 01:22:11,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 22.8) internal successors, (342), 15 states have internal predecessors, (342), 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:22:11,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:11,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:11,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:22:11,560 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:22:11,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:11,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 361657484, now seen corresponding path program 1 times [2025-03-09 01:22:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840868788] [2025-03-09 01:22:11,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:11,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:11,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:22:11,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:22:11,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:11,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:11,636 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:22:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840868788] [2025-03-09 01:22:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840868788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:22:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159328540] [2025-03-09 01:22:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:11,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:22:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:11,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:22:11,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:22:11,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 75 [2025-03-09 01:22:11,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:11,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:11,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 75 [2025-03-09 01:22:11,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:12,021 INFO L124 PetriNetUnfolderBase]: 4290/6536 cut-off events. [2025-03-09 01:22:12,021 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 01:22:12,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13045 conditions, 6536 events. 4290/6536 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 33954 event pairs, 4288 based on Foata normal form. 0/6524 useless extension candidates. Maximal degree in co-relation 13019. Up to 6339 conditions per place. [2025-03-09 01:22:12,052 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 55 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-03-09 01:22:12,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 66 transitions, 288 flow [2025-03-09 01:22:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:22:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:22:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-03-09 01:22:12,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37 [2025-03-09 01:22:12,054 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 180 flow. Second operand 4 states and 111 transitions. [2025-03-09 01:22:12,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 66 transitions, 288 flow [2025-03-09 01:22:12,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 254 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-09 01:22:12,057 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 144 flow [2025-03-09 01:22:12,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-03-09 01:22:12,058 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-03-09 01:22:12,059 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 144 flow [2025-03-09 01:22:12,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:12,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:12,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:12,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:22:12,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 361657485, now seen corresponding path program 1 times [2025-03-09 01:22:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401839931] [2025-03-09 01:22:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:12,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:22:12,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:22:12,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:12,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:12,152 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:22:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401839931] [2025-03-09 01:22:12,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401839931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:12,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:12,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:22:12,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037314458] [2025-03-09 01:22:12,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:12,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:12,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:12,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:12,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-09 01:22:12,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:22:12,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:12,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-09 01:22:12,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:12,443 INFO L124 PetriNetUnfolderBase]: 2569/4220 cut-off events. [2025-03-09 01:22:12,444 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 01:22:12,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 4220 events. 2569/4220 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 24436 event pairs, 2568 based on Foata normal form. 1/4007 useless extension candidates. Maximal degree in co-relation 8165. Up to 3865 conditions per place. [2025-03-09 01:22:12,457 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 51 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-09 01:22:12,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 246 flow [2025-03-09 01:22:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-09 01:22:12,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 01:22:12,459 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 144 flow. Second operand 3 states and 120 transitions. [2025-03-09 01:22:12,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 246 flow [2025-03-09 01:22:12,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:12,462 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 141 flow [2025-03-09 01:22:12,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-09 01:22:12,463 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-03-09 01:22:12,464 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 141 flow [2025-03-09 01:22:12,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:22:12,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:12,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:12,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:22:12,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:12,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash 5059091, now seen corresponding path program 1 times [2025-03-09 01:22:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158073388] [2025-03-09 01:22:12,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:12,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:22:12,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:22:12,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:12,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:12,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158073388] [2025-03-09 01:22:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158073388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671362701] [2025-03-09 01:22:12,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:12,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:12,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:12,658 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:22:12,660 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:22:12,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:22:12,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:22:12,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:12,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:12,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:22:12,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:12,734 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:22:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:12,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:22:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671362701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:22:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-09 01:22:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393248136] [2025-03-09 01:22:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:12,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:22:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:12,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:22:12,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:22:12,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-09 01:22:12,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:22:12,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:12,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-09 01:22:12,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:13,189 INFO L124 PetriNetUnfolderBase]: 3049/4876 cut-off events. [2025-03-09 01:22:13,190 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-09 01:22:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9550 conditions, 4876 events. 3049/4876 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 27483 event pairs, 648 based on Foata normal form. 203/5006 useless extension candidates. Maximal degree in co-relation 9519. Up to 3468 conditions per place. [2025-03-09 01:22:13,207 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 72 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-03-09 01:22:13,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 85 transitions, 333 flow [2025-03-09 01:22:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:22:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:22:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-03-09 01:22:13,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-03-09 01:22:13,209 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 141 flow. Second operand 4 states and 154 transitions. [2025-03-09 01:22:13,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 85 transitions, 333 flow [2025-03-09 01:22:13,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:13,211 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 141 flow [2025-03-09 01:22:13,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2025-03-09 01:22:13,211 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2025-03-09 01:22:13,211 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 141 flow [2025-03-09 01:22:13,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:22:13,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:13,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:13,218 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:22:13,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:22:13,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash -77942573, now seen corresponding path program 1 times [2025-03-09 01:22:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619847214] [2025-03-09 01:22:13,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:13,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:22:13,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:22:13,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:13,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619847214] [2025-03-09 01:22:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619847214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524640941] [2025-03-09 01:22:13,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:13,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:13,610 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:22:13,612 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:22:13,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:22:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:22:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:13,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:13,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:22:13,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:13,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:22:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524640941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:13,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:22:13,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 01:22:13,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264109173] [2025-03-09 01:22:13,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:13,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:22:13,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:13,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:22:13,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:22:13,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-09 01:22:13,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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:22:13,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:13,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-09 01:22:13,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:14,189 INFO L124 PetriNetUnfolderBase]: 3132/5083 cut-off events. [2025-03-09 01:22:14,189 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2025-03-09 01:22:14,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10232 conditions, 5083 events. 3132/5083 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 29461 event pairs, 1082 based on Foata normal form. 122/5073 useless extension candidates. Maximal degree in co-relation 10194. Up to 1782 conditions per place. [2025-03-09 01:22:14,206 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 102 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-03-09 01:22:14,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 479 flow [2025-03-09 01:22:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:22:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:22:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2025-03-09 01:22:14,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-09 01:22:14,208 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 141 flow. Second operand 6 states and 234 transitions. [2025-03-09 01:22:14,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 479 flow [2025-03-09 01:22:14,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 118 transitions, 467 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:22:14,213 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 173 flow [2025-03-09 01:22:14,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-03-09 01:22:14,215 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -4 predicate places. [2025-03-09 01:22:14,215 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 173 flow [2025-03-09 01:22:14,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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:22:14,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:14,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:14,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:22:14,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:14,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:14,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash 392054916, now seen corresponding path program 1 times [2025-03-09 01:22:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073870055] [2025-03-09 01:22:14,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:14,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:22:14,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:22:14,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:14,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073870055] [2025-03-09 01:22:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073870055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561225921] [2025-03-09 01:22:14,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:14,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:14,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:14,571 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:22:14,573 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:22:14,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:22:14,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:22:14,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:14,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:14,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:22:14,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:14,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:14,837 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 36 treesize of output 32 [2025-03-09 01:22:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561225921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:15,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:15,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-09 01:22:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835106064] [2025-03-09 01:22:15,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:15,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:22:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:15,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:22:15,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:22:15,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:22:15,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 173 flow. Second operand has 17 states, 17 states have (on average 21.764705882352942) internal successors, (370), 17 states have internal predecessors, (370), 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:22:15,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:15,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:22:15,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:16,478 INFO L124 PetriNetUnfolderBase]: 8921/13663 cut-off events. [2025-03-09 01:22:16,478 INFO L125 PetriNetUnfolderBase]: For 2240/2296 co-relation queries the response was YES. [2025-03-09 01:22:16,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29196 conditions, 13663 events. 8921/13663 cut-off events. For 2240/2296 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 84049 event pairs, 4288 based on Foata normal form. 0/13322 useless extension candidates. Maximal degree in co-relation 17727. Up to 5415 conditions per place. [2025-03-09 01:22:16,539 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 164 selfloop transitions, 17 changer transitions 0/189 dead transitions. [2025-03-09 01:22:16,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 189 transitions, 877 flow [2025-03-09 01:22:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:22:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:22:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 360 transitions. [2025-03-09 01:22:16,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-09 01:22:16,542 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 173 flow. Second operand 11 states and 360 transitions. [2025-03-09 01:22:16,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 189 transitions, 877 flow [2025-03-09 01:22:16,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 189 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:16,555 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 252 flow [2025-03-09 01:22:16,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=252, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-09 01:22:16,557 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-03-09 01:22:16,558 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 252 flow [2025-03-09 01:22:16,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.764705882352942) internal successors, (370), 17 states have internal predecessors, (370), 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:22:16,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:16,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:16,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:22:16,759 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:22:16,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:16,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash -142094187, now seen corresponding path program 1 times [2025-03-09 01:22:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243549537] [2025-03-09 01:22:16,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:16,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:22:16,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:22:16,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:16,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243549537] [2025-03-09 01:22:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243549537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284008551] [2025-03-09 01:22:16,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:16,958 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:22:16,960 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:22:16,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:22:17,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:22:17,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:17,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:17,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:22:17,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:17,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:22:17,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284008551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:17,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:22:17,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 01:22:17,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395386178] [2025-03-09 01:22:17,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:17,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:22:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:17,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:22:17,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:22:17,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-09 01:22:17,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:17,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:17,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-09 01:22:17,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:17,883 INFO L124 PetriNetUnfolderBase]: 7233/11699 cut-off events. [2025-03-09 01:22:17,883 INFO L125 PetriNetUnfolderBase]: For 6203/6203 co-relation queries the response was YES. [2025-03-09 01:22:17,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27546 conditions, 11699 events. 7233/11699 cut-off events. For 6203/6203 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 78128 event pairs, 2588 based on Foata normal form. 250/11893 useless extension candidates. Maximal degree in co-relation 16828. Up to 4860 conditions per place. [2025-03-09 01:22:17,924 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 114 selfloop transitions, 8 changer transitions 0/134 dead transitions. [2025-03-09 01:22:17,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 134 transitions, 689 flow [2025-03-09 01:22:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:22:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:22:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 232 transitions. [2025-03-09 01:22:17,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2025-03-09 01:22:17,926 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 252 flow. Second operand 6 states and 232 transitions. [2025-03-09 01:22:17,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 134 transitions, 689 flow [2025-03-09 01:22:17,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 134 transitions, 683 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:22:17,934 INFO L231 Difference]: Finished difference. Result has 93 places, 78 transitions, 287 flow [2025-03-09 01:22:17,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=93, PETRI_TRANSITIONS=78} [2025-03-09 01:22:17,934 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2025-03-09 01:22:17,934 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 287 flow [2025-03-09 01:22:17,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:17,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:17,935 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:17,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:22:18,139 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:22:18,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:18,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1678307650, now seen corresponding path program 2 times [2025-03-09 01:22:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066796635] [2025-03-09 01:22:18,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:18,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 01:22:18,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:22:18,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:18,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:18,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066796635] [2025-03-09 01:22:18,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066796635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883807867] [2025-03-09 01:22:18,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:18,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:18,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:18,280 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:22:18,283 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:22:18,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 01:22:18,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:22:18,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:18,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:18,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:22:18,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:18,345 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:22:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:18,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:22:18,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883807867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:18,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:22:18,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 01:22:18,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581365410] [2025-03-09 01:22:18,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:18,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:22:18,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:18,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:22:18,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:22:18,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-09 01:22:18,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:22:18,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:18,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-09 01:22:18,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:19,151 INFO L124 PetriNetUnfolderBase]: 7023/11047 cut-off events. [2025-03-09 01:22:19,151 INFO L125 PetriNetUnfolderBase]: For 7126/7174 co-relation queries the response was YES. [2025-03-09 01:22:19,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27249 conditions, 11047 events. 7023/11047 cut-off events. For 7126/7174 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 68836 event pairs, 3002 based on Foata normal form. 302/11271 useless extension candidates. Maximal degree in co-relation 16849. Up to 5796 conditions per place. [2025-03-09 01:22:19,196 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 83 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2025-03-09 01:22:19,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 104 transitions, 568 flow [2025-03-09 01:22:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:22:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:22:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-03-09 01:22:19,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4613333333333333 [2025-03-09 01:22:19,197 INFO L175 Difference]: Start difference. First operand has 93 places, 78 transitions, 287 flow. Second operand 5 states and 173 transitions. [2025-03-09 01:22:19,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 104 transitions, 568 flow [2025-03-09 01:22:19,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 104 transitions, 558 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:22:19,211 INFO L231 Difference]: Finished difference. Result has 93 places, 77 transitions, 292 flow [2025-03-09 01:22:19,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=93, PETRI_TRANSITIONS=77} [2025-03-09 01:22:19,211 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2025-03-09 01:22:19,212 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 77 transitions, 292 flow [2025-03-09 01:22:19,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:22:19,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:19,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:19,220 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:22:19,416 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:22:19,416 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 838915559, now seen corresponding path program 1 times [2025-03-09 01:22:19,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:19,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702120075] [2025-03-09 01:22:19,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:19,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:22:19,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:22:19,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:19,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:19,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702120075] [2025-03-09 01:22:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702120075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:19,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:22:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674134622] [2025-03-09 01:22:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:19,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:19,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:19,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:19,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-09 01:22:19,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 77 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:19,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:19,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-09 01:22:19,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:20,212 INFO L124 PetriNetUnfolderBase]: 6975/11383 cut-off events. [2025-03-09 01:22:20,212 INFO L125 PetriNetUnfolderBase]: For 11296/11296 co-relation queries the response was YES. [2025-03-09 01:22:20,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29120 conditions, 11383 events. 6975/11383 cut-off events. For 11296/11296 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 76930 event pairs, 5422 based on Foata normal form. 48/11345 useless extension candidates. Maximal degree in co-relation 15795. Up to 9116 conditions per place. [2025-03-09 01:22:20,415 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 82 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-03-09 01:22:20,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 96 transitions, 539 flow [2025-03-09 01:22:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-03-09 01:22:20,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2025-03-09 01:22:20,417 INFO L175 Difference]: Start difference. First operand has 93 places, 77 transitions, 292 flow. Second operand 3 states and 134 transitions. [2025-03-09 01:22:20,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 96 transitions, 539 flow [2025-03-09 01:22:20,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 509 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:22:20,433 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 282 flow [2025-03-09 01:22:20,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2025-03-09 01:22:20,434 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2025-03-09 01:22:20,434 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 77 transitions, 282 flow [2025-03-09 01:22:20,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:20,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:20,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:20,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:22:20,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:20,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1087172273, now seen corresponding path program 2 times [2025-03-09 01:22:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:20,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772707535] [2025-03-09 01:22:20,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:20,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:22:20,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 37 statements. [2025-03-09 01:22:20,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:22:20,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:20,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772707535] [2025-03-09 01:22:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772707535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:22:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48063231] [2025-03-09 01:22:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:20,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:22:20,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:20,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:22:20,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:22:20,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-09 01:22:20,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 77 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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:22:20,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:20,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-09 01:22:20,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:21,344 INFO L124 PetriNetUnfolderBase]: 8547/13971 cut-off events. [2025-03-09 01:22:21,344 INFO L125 PetriNetUnfolderBase]: For 9728/9728 co-relation queries the response was YES. [2025-03-09 01:22:21,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34587 conditions, 13971 events. 8547/13971 cut-off events. For 9728/9728 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 100240 event pairs, 4486 based on Foata normal form. 168/14031 useless extension candidates. Maximal degree in co-relation 19031. Up to 8067 conditions per place. [2025-03-09 01:22:21,399 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 119 selfloop transitions, 8 changer transitions 1/140 dead transitions. [2025-03-09 01:22:21,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 140 transitions, 772 flow [2025-03-09 01:22:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:22:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:22:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2025-03-09 01:22:21,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.568 [2025-03-09 01:22:21,400 INFO L175 Difference]: Start difference. First operand has 92 places, 77 transitions, 282 flow. Second operand 5 states and 213 transitions. [2025-03-09 01:22:21,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 140 transitions, 772 flow [2025-03-09 01:22:21,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 140 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:21,426 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 331 flow [2025-03-09 01:22:21,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-03-09 01:22:21,427 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 17 predicate places. [2025-03-09 01:22:21,427 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 331 flow [2025-03-09 01:22:21,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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:22:21,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:21,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:21,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:22:21,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:21,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1782306481, now seen corresponding path program 3 times [2025-03-09 01:22:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365313351] [2025-03-09 01:22:21,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:21,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-03-09 01:22:21,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 37 statements. [2025-03-09 01:22:21,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:22:21,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:21,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:21,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365313351] [2025-03-09 01:22:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365313351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:21,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:22:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6036954] [2025-03-09 01:22:21,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:22:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:21,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:22:21,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:22:21,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-09 01:22:21,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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:22:21,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:21,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-09 01:22:21,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:22,050 INFO L124 PetriNetUnfolderBase]: 5375/9057 cut-off events. [2025-03-09 01:22:22,050 INFO L125 PetriNetUnfolderBase]: For 7570/7570 co-relation queries the response was YES. [2025-03-09 01:22:22,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23761 conditions, 9057 events. 5375/9057 cut-off events. For 7570/7570 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 62808 event pairs, 2438 based on Foata normal form. 144/9133 useless extension candidates. Maximal degree in co-relation 15627. Up to 3747 conditions per place. [2025-03-09 01:22:22,082 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 108 selfloop transitions, 9 changer transitions 2/131 dead transitions. [2025-03-09 01:22:22,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 131 transitions, 739 flow [2025-03-09 01:22:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:22:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:22:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2025-03-09 01:22:22,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493333333333333 [2025-03-09 01:22:22,083 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 331 flow. Second operand 5 states and 206 transitions. [2025-03-09 01:22:22,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 131 transitions, 739 flow [2025-03-09 01:22:22,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 131 transitions, 731 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:22,108 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 334 flow [2025-03-09 01:22:22,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2025-03-09 01:22:22,108 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 20 predicate places. [2025-03-09 01:22:22,109 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 334 flow [2025-03-09 01:22:22,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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:22:22,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:22,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:22:22,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:22,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash 174027054, now seen corresponding path program 1 times [2025-03-09 01:22:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457654473] [2025-03-09 01:22:22,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:22,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:22,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:22:22,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:22:22,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:22,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457654473] [2025-03-09 01:22:22,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457654473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405534065] [2025-03-09 01:22:22,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:22,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:22,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:22,264 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:22:22,266 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:22:22,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:22:22,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:22:22,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:22,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:22,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:22:22,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:22,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:22,692 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 36 treesize of output 32 [2025-03-09 01:22:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405534065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:22,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:22,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-03-09 01:22:22,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982750572] [2025-03-09 01:22:22,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:22,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:22:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:22,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:22:22,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:22:23,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-09 01:22:23,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 334 flow. Second operand has 21 states, 21 states have (on average 23.333333333333332) internal successors, (490), 21 states have internal predecessors, (490), 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:22:23,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:23,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-09 01:22:23,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:24,970 INFO L124 PetriNetUnfolderBase]: 5967/9585 cut-off events. [2025-03-09 01:22:24,970 INFO L125 PetriNetUnfolderBase]: For 8574/8574 co-relation queries the response was YES. [2025-03-09 01:22:24,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26109 conditions, 9585 events. 5967/9585 cut-off events. For 8574/8574 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 61468 event pairs, 1891 based on Foata normal form. 116/9667 useless extension candidates. Maximal degree in co-relation 16176. Up to 2226 conditions per place. [2025-03-09 01:22:25,025 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 203 selfloop transitions, 32 changer transitions 0/244 dead transitions. [2025-03-09 01:22:25,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 244 transitions, 1403 flow [2025-03-09 01:22:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:22:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 01:22:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 598 transitions. [2025-03-09 01:22:25,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39866666666666667 [2025-03-09 01:22:25,027 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 334 flow. Second operand 20 states and 598 transitions. [2025-03-09 01:22:25,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 244 transitions, 1403 flow [2025-03-09 01:22:25,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 244 transitions, 1393 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-09 01:22:25,043 INFO L231 Difference]: Finished difference. Result has 119 places, 94 transitions, 451 flow [2025-03-09 01:22:25,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=451, PETRI_PLACES=119, PETRI_TRANSITIONS=94} [2025-03-09 01:22:25,044 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 39 predicate places. [2025-03-09 01:22:25,044 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 94 transitions, 451 flow [2025-03-09 01:22:25,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 23.333333333333332) internal successors, (490), 21 states have internal predecessors, (490), 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:22:25,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:25,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:25,051 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:22:25,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:25,245 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:25,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash -63755517, now seen corresponding path program 1 times [2025-03-09 01:22:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:25,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099956455] [2025-03-09 01:22:25,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:25,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:22:25,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:22:25,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:25,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:22:25,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:25,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099956455] [2025-03-09 01:22:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099956455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:25,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:25,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:22:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447531534] [2025-03-09 01:22:25,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:25,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:25,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:25,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:25,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:25,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2025-03-09 01:22:25,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 94 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:22:25,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:25,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2025-03-09 01:22:25,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:25,977 INFO L124 PetriNetUnfolderBase]: 5183/8647 cut-off events. [2025-03-09 01:22:25,977 INFO L125 PetriNetUnfolderBase]: For 9793/9793 co-relation queries the response was YES. [2025-03-09 01:22:26,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24683 conditions, 8647 events. 5183/8647 cut-off events. For 9793/9793 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 57537 event pairs, 3846 based on Foata normal form. 24/8629 useless extension candidates. Maximal degree in co-relation 18052. Up to 6632 conditions per place. [2025-03-09 01:22:26,037 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 105 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2025-03-09 01:22:26,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 785 flow [2025-03-09 01:22:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-03-09 01:22:26,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:22:26,038 INFO L175 Difference]: Start difference. First operand has 119 places, 94 transitions, 451 flow. Second operand 3 states and 135 transitions. [2025-03-09 01:22:26,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 785 flow [2025-03-09 01:22:26,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 764 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-09 01:22:26,057 INFO L231 Difference]: Finished difference. Result has 114 places, 94 transitions, 438 flow [2025-03-09 01:22:26,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=114, PETRI_TRANSITIONS=94} [2025-03-09 01:22:26,058 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 34 predicate places. [2025-03-09 01:22:26,058 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 94 transitions, 438 flow [2025-03-09 01:22:26,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:22:26,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:26,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:26,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:22:26,058 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:26,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:26,058 INFO L85 PathProgramCache]: Analyzing trace with hash -48238495, now seen corresponding path program 2 times [2025-03-09 01:22:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:26,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511052797] [2025-03-09 01:22:26,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:26,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-09 01:22:26,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:22:26,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:26,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511052797] [2025-03-09 01:22:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511052797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830610197] [2025-03-09 01:22:26,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:26,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:26,265 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:22:26,279 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:22:26,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-09 01:22:26,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:22:26,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:26,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:26,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:22:26,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:26,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:26,715 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 36 treesize of output 32 [2025-03-09 01:22:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830610197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:26,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-09 01:22:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559515612] [2025-03-09 01:22:26,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:26,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:22:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:26,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:22:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:22:27,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-09 01:22:27,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 94 transitions, 438 flow. Second operand has 23 states, 23 states have (on average 22.956521739130434) internal successors, (528), 23 states have internal predecessors, (528), 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:22:27,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:27,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-09 01:22:27,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:28,830 INFO L124 PetriNetUnfolderBase]: 6027/9593 cut-off events. [2025-03-09 01:22:28,830 INFO L125 PetriNetUnfolderBase]: For 10848/10848 co-relation queries the response was YES. [2025-03-09 01:22:28,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28318 conditions, 9593 events. 6027/9593 cut-off events. For 10848/10848 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 60810 event pairs, 2344 based on Foata normal form. 48/9603 useless extension candidates. Maximal degree in co-relation 20451. Up to 2508 conditions per place. [2025-03-09 01:22:28,889 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 219 selfloop transitions, 24 changer transitions 0/251 dead transitions. [2025-03-09 01:22:28,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 251 transitions, 1523 flow [2025-03-09 01:22:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:22:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-09 01:22:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 585 transitions. [2025-03-09 01:22:28,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4105263157894737 [2025-03-09 01:22:28,891 INFO L175 Difference]: Start difference. First operand has 114 places, 94 transitions, 438 flow. Second operand 19 states and 585 transitions. [2025-03-09 01:22:28,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 251 transitions, 1523 flow [2025-03-09 01:22:28,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 251 transitions, 1501 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:28,909 INFO L231 Difference]: Finished difference. Result has 132 places, 97 transitions, 497 flow [2025-03-09 01:22:28,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=497, PETRI_PLACES=132, PETRI_TRANSITIONS=97} [2025-03-09 01:22:28,910 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 52 predicate places. [2025-03-09 01:22:28,910 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 97 transitions, 497 flow [2025-03-09 01:22:28,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 22.956521739130434) internal successors, (528), 23 states have internal predecessors, (528), 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:22:28,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:28,911 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:28,916 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:22:29,111 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,SelfDestructingSolverStorable15 [2025-03-09 01:22:29,111 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:29,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash 892105405, now seen corresponding path program 3 times [2025-03-09 01:22:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:29,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910339162] [2025-03-09 01:22:29,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:29,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-09 01:22:29,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 41 statements. [2025-03-09 01:22:29,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:22:29,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:22:29,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910339162] [2025-03-09 01:22:29,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910339162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120998438] [2025-03-09 01:22:29,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:29,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:29,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:29,262 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:22:29,263 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:22:29,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-09 01:22:29,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 41 statements. [2025-03-09 01:22:29,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:22:29,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:29,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:22:29,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:29,339 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:22:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:22:29,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:22:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120998438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:29,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:22:29,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-09 01:22:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278074154] [2025-03-09 01:22:29,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:29,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:22:29,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:29,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:22:29,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:22:29,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-03-09 01:22:29,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 97 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 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:22:29,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:29,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-03-09 01:22:29,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:30,089 INFO L124 PetriNetUnfolderBase]: 5183/8621 cut-off events. [2025-03-09 01:22:30,090 INFO L125 PetriNetUnfolderBase]: For 11374/11374 co-relation queries the response was YES. [2025-03-09 01:22:30,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25880 conditions, 8621 events. 5183/8621 cut-off events. For 11374/11374 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 57199 event pairs, 2302 based on Foata normal form. 48/8607 useless extension candidates. Maximal degree in co-relation 23885. Up to 3816 conditions per place. [2025-03-09 01:22:30,133 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 111 selfloop transitions, 23 changer transitions 0/147 dead transitions. [2025-03-09 01:22:30,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 147 transitions, 955 flow [2025-03-09 01:22:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:22:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:22:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2025-03-09 01:22:30,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46095238095238095 [2025-03-09 01:22:30,135 INFO L175 Difference]: Start difference. First operand has 132 places, 97 transitions, 497 flow. Second operand 7 states and 242 transitions. [2025-03-09 01:22:30,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 147 transitions, 955 flow [2025-03-09 01:22:30,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 147 transitions, 909 flow, removed 2 selfloop flow, removed 14 redundant places. [2025-03-09 01:22:30,151 INFO L231 Difference]: Finished difference. Result has 123 places, 97 transitions, 495 flow [2025-03-09 01:22:30,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=495, PETRI_PLACES=123, PETRI_TRANSITIONS=97} [2025-03-09 01:22:30,152 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 43 predicate places. [2025-03-09 01:22:30,152 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 495 flow [2025-03-09 01:22:30,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 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:22:30,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:30,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:30,158 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:22:30,352 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,SelfDestructingSolverStorable16 [2025-03-09 01:22:30,353 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:30,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash -911208816, now seen corresponding path program 1 times [2025-03-09 01:22:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702880673] [2025-03-09 01:22:30,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:30,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:30,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 01:22:30,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 01:22:30,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:30,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702880673] [2025-03-09 01:22:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702880673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870352089] [2025-03-09 01:22:30,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:30,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:30,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:30,736 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:22:30,738 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:22:30,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 01:22:30,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 01:22:30,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:30,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:30,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 01:22:30,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:31,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:22:31,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-03-09 01:22:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:31,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:31,649 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-09 01:22:31,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2025-03-09 01:22:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:22:31,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870352089] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:31,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:22:31,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [14, 17] total 38 [2025-03-09 01:22:31,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300599105] [2025-03-09 01:22:31,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:31,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:22:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:31,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:22:31,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1293, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 01:22:32,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:22:32,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 495 flow. Second operand has 15 states, 15 states have (on average 21.666666666666668) internal successors, (325), 15 states have internal predecessors, (325), 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:22:32,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:32,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:22:32,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:33,951 INFO L124 PetriNetUnfolderBase]: 8857/13793 cut-off events. [2025-03-09 01:22:33,951 INFO L125 PetriNetUnfolderBase]: For 15697/15697 co-relation queries the response was YES. [2025-03-09 01:22:34,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42168 conditions, 13793 events. 8857/13793 cut-off events. For 15697/15697 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 83958 event pairs, 1556 based on Foata normal form. 2/13773 useless extension candidates. Maximal degree in co-relation 29230. Up to 9055 conditions per place. [2025-03-09 01:22:34,048 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 207 selfloop transitions, 44 changer transitions 77/332 dead transitions. [2025-03-09 01:22:34,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 332 transitions, 2484 flow [2025-03-09 01:22:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:22:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:22:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 606 transitions. [2025-03-09 01:22:34,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38476190476190475 [2025-03-09 01:22:34,050 INFO L175 Difference]: Start difference. First operand has 123 places, 97 transitions, 495 flow. Second operand 21 states and 606 transitions. [2025-03-09 01:22:34,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 332 transitions, 2484 flow [2025-03-09 01:22:34,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 332 transitions, 2438 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:22:34,086 INFO L231 Difference]: Finished difference. Result has 156 places, 132 transitions, 968 flow [2025-03-09 01:22:34,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=968, PETRI_PLACES=156, PETRI_TRANSITIONS=132} [2025-03-09 01:22:34,086 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 76 predicate places. [2025-03-09 01:22:34,086 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 132 transitions, 968 flow [2025-03-09 01:22:34,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.666666666666668) internal successors, (325), 15 states have internal predecessors, (325), 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:22:34,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:34,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:34,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:22:34,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:22:34,287 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:34,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2051808056, now seen corresponding path program 2 times [2025-03-09 01:22:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:34,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066673567] [2025-03-09 01:22:34,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:34,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-09 01:22:34,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-09 01:22:34,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:22:34,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:22:34,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:34,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066673567] [2025-03-09 01:22:34,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066673567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:34,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:34,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:22:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528125445] [2025-03-09 01:22:34,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:34,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:22:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:34,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:22:34,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:22:34,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:22:34,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 132 transitions, 968 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 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:22:34,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:34,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:22:34,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:36,279 INFO L124 PetriNetUnfolderBase]: 10145/15729 cut-off events. [2025-03-09 01:22:36,279 INFO L125 PetriNetUnfolderBase]: For 32031/32031 co-relation queries the response was YES. [2025-03-09 01:22:36,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57040 conditions, 15729 events. 10145/15729 cut-off events. For 32031/32031 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 98098 event pairs, 2234 based on Foata normal form. 2/15709 useless extension candidates. Maximal degree in co-relation 56991. Up to 10097 conditions per place. [2025-03-09 01:22:36,374 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 247 selfloop transitions, 82 changer transitions 62/395 dead transitions. [2025-03-09 01:22:36,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 395 transitions, 3190 flow [2025-03-09 01:22:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 01:22:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-09 01:22:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 742 transitions. [2025-03-09 01:22:36,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3664197530864198 [2025-03-09 01:22:36,376 INFO L175 Difference]: Start difference. First operand has 156 places, 132 transitions, 968 flow. Second operand 27 states and 742 transitions. [2025-03-09 01:22:36,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 395 transitions, 3190 flow [2025-03-09 01:22:36,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 395 transitions, 3086 flow, removed 28 selfloop flow, removed 11 redundant places. [2025-03-09 01:22:36,523 INFO L231 Difference]: Finished difference. Result has 180 places, 199 transitions, 1766 flow [2025-03-09 01:22:36,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1766, PETRI_PLACES=180, PETRI_TRANSITIONS=199} [2025-03-09 01:22:36,524 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 100 predicate places. [2025-03-09 01:22:36,524 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 199 transitions, 1766 flow [2025-03-09 01:22:36,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 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:22:36,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:36,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:36,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:22:36,524 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:36,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:36,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2011282630, now seen corresponding path program 3 times [2025-03-09 01:22:36,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:36,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524765893] [2025-03-09 01:22:36,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:36,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 3 equivalence classes. [2025-03-09 01:22:36,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-09 01:22:36,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:22:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:22:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524765893] [2025-03-09 01:22:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524765893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:36,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:22:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687142447] [2025-03-09 01:22:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:36,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:22:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:36,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:22:36,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:22:36,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:22:36,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 199 transitions, 1766 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 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:22:36,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:36,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:22:36,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:38,779 INFO L124 PetriNetUnfolderBase]: 10245/15833 cut-off events. [2025-03-09 01:22:38,779 INFO L125 PetriNetUnfolderBase]: For 51852/51852 co-relation queries the response was YES. [2025-03-09 01:22:38,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64282 conditions, 15833 events. 10245/15833 cut-off events. For 51852/51852 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 98248 event pairs, 2069 based on Foata normal form. 2/15813 useless extension candidates. Maximal degree in co-relation 64222. Up to 10255 conditions per place. [2025-03-09 01:22:38,909 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 277 selfloop transitions, 105 changer transitions 27/413 dead transitions. [2025-03-09 01:22:38,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 413 transitions, 3718 flow [2025-03-09 01:22:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 01:22:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-09 01:22:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 731 transitions. [2025-03-09 01:22:38,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3748717948717949 [2025-03-09 01:22:38,911 INFO L175 Difference]: Start difference. First operand has 180 places, 199 transitions, 1766 flow. Second operand 26 states and 731 transitions. [2025-03-09 01:22:38,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 413 transitions, 3718 flow [2025-03-09 01:22:39,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 413 transitions, 3541 flow, removed 77 selfloop flow, removed 8 redundant places. [2025-03-09 01:22:39,269 INFO L231 Difference]: Finished difference. Result has 199 places, 224 transitions, 2180 flow [2025-03-09 01:22:39,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2180, PETRI_PLACES=199, PETRI_TRANSITIONS=224} [2025-03-09 01:22:39,270 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 119 predicate places. [2025-03-09 01:22:39,270 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 224 transitions, 2180 flow [2025-03-09 01:22:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 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:22:39,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:39,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:39,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:22:39,270 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 839844942, now seen corresponding path program 4 times [2025-03-09 01:22:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321867270] [2025-03-09 01:22:39,271 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:39,276 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-09 01:22:39,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 59 statements. [2025-03-09 01:22:39,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:22:39,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:22:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321867270] [2025-03-09 01:22:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321867270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:39,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:39,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:22:39,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836684533] [2025-03-09 01:22:39,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:39,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:22:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:39,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:22:39,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:22:39,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:22:39,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 224 transitions, 2180 flow. Second operand has 11 states, 11 states have (on average 23.0) internal successors, (253), 11 states have internal predecessors, (253), 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:22:39,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:39,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:22:39,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:41,737 INFO L124 PetriNetUnfolderBase]: 11389/17571 cut-off events. [2025-03-09 01:22:41,737 INFO L125 PetriNetUnfolderBase]: For 72540/72540 co-relation queries the response was YES. [2025-03-09 01:22:41,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75671 conditions, 17571 events. 11389/17571 cut-off events. For 72540/72540 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 110037 event pairs, 2230 based on Foata normal form. 2/17551 useless extension candidates. Maximal degree in co-relation 69781. Up to 9615 conditions per place. [2025-03-09 01:22:41,876 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 315 selfloop transitions, 120 changer transitions 43/482 dead transitions. [2025-03-09 01:22:41,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 482 transitions, 4764 flow [2025-03-09 01:22:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:22:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 01:22:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 701 transitions. [2025-03-09 01:22:41,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3894444444444444 [2025-03-09 01:22:41,878 INFO L175 Difference]: Start difference. First operand has 199 places, 224 transitions, 2180 flow. Second operand 24 states and 701 transitions. [2025-03-09 01:22:41,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 482 transitions, 4764 flow [2025-03-09 01:22:42,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 482 transitions, 4455 flow, removed 78 selfloop flow, removed 17 redundant places. [2025-03-09 01:22:42,387 INFO L231 Difference]: Finished difference. Result has 209 places, 262 transitions, 2692 flow [2025-03-09 01:22:42,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2692, PETRI_PLACES=209, PETRI_TRANSITIONS=262} [2025-03-09 01:22:42,387 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 129 predicate places. [2025-03-09 01:22:42,387 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 262 transitions, 2692 flow [2025-03-09 01:22:42,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.0) internal successors, (253), 11 states have internal predecessors, (253), 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:22:42,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:42,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:42,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:22:42,388 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:22:42,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1516702464, now seen corresponding path program 5 times [2025-03-09 01:22:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003559896] [2025-03-09 01:22:42,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:22:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:42,394 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 3 equivalence classes. [2025-03-09 01:22:42,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 01:22:42,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:22:42,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:42,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003559896] [2025-03-09 01:22:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003559896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78854056] [2025-03-09 01:22:42,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:22:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:42,679 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:42,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:22:42,727 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 3 equivalence classes. [2025-03-09 01:22:42,751 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 01:22:42,752 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:22:42,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:42,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:22:42,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:43,183 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-09 01:22:43,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 24 [2025-03-09 01:22:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:43,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:43,520 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2025-03-09 01:22:43,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 53 [2025-03-09 01:22:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78854056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:43,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:43,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 36 [2025-03-09 01:22:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132150114] [2025-03-09 01:22:43,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:43,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:22:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:43,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:22:43,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:22:45,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:22:45,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 262 transitions, 2692 flow. Second operand has 36 states, 36 states have (on average 21.416666666666668) internal successors, (771), 36 states have internal predecessors, (771), 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:22:45,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:45,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:22:45,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:53,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-09 01:22:59,110 INFO L124 PetriNetUnfolderBase]: 16397/25225 cut-off events. [2025-03-09 01:22:59,110 INFO L125 PetriNetUnfolderBase]: For 129805/129805 co-relation queries the response was YES. [2025-03-09 01:22:59,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115151 conditions, 25225 events. 16397/25225 cut-off events. For 129805/129805 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 168418 event pairs, 3002 based on Foata normal form. 2/25216 useless extension candidates. Maximal degree in co-relation 108302. Up to 7851 conditions per place. [2025-03-09 01:22:59,367 INFO L140 encePairwiseOnDemand]: 52/75 looper letters, 665 selfloop transitions, 222 changer transitions 79/970 dead transitions. [2025-03-09 01:22:59,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 970 transitions, 9222 flow [2025-03-09 01:22:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-09 01:22:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-03-09 01:22:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 1711 transitions. [2025-03-09 01:22:59,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37398907103825135 [2025-03-09 01:22:59,370 INFO L175 Difference]: Start difference. First operand has 209 places, 262 transitions, 2692 flow. Second operand 61 states and 1711 transitions. [2025-03-09 01:22:59,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 970 transitions, 9222 flow [2025-03-09 01:23:00,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 970 transitions, 8676 flow, removed 217 selfloop flow, removed 14 redundant places. [2025-03-09 01:23:00,747 INFO L231 Difference]: Finished difference. Result has 278 places, 419 transitions, 4887 flow [2025-03-09 01:23:00,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2486, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=4887, PETRI_PLACES=278, PETRI_TRANSITIONS=419} [2025-03-09 01:23:00,747 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 198 predicate places. [2025-03-09 01:23:00,747 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 419 transitions, 4887 flow [2025-03-09 01:23:00,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 21.416666666666668) internal successors, (771), 36 states have internal predecessors, (771), 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:23:00,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:00,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:00,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:23:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:23:00,948 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:23:00,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -454147158, now seen corresponding path program 6 times [2025-03-09 01:23:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282604236] [2025-03-09 01:23:00,949 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:23:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:00,959 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 3 equivalence classes. [2025-03-09 01:23:00,971 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-09 01:23:00,972 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:23:00,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:23:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282604236] [2025-03-09 01:23:01,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282604236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:01,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:01,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:23:01,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57120595] [2025-03-09 01:23:01,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:01,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:23:01,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:01,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:23:01,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:23:01,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:23:01,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 419 transitions, 4887 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 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:23:01,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:01,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:23:01,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:05,870 INFO L124 PetriNetUnfolderBase]: 19632/30077 cut-off events. [2025-03-09 01:23:05,870 INFO L125 PetriNetUnfolderBase]: For 203000/203000 co-relation queries the response was YES. [2025-03-09 01:23:06,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150951 conditions, 30077 events. 19632/30077 cut-off events. For 203000/203000 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 203816 event pairs, 5373 based on Foata normal form. 2/30057 useless extension candidates. Maximal degree in co-relation 150851. Up to 23404 conditions per place. [2025-03-09 01:23:06,269 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 579 selfloop transitions, 176 changer transitions 31/790 dead transitions. [2025-03-09 01:23:06,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 790 transitions, 9702 flow [2025-03-09 01:23:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 01:23:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-09 01:23:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 862 transitions. [2025-03-09 01:23:06,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.370752688172043 [2025-03-09 01:23:06,270 INFO L175 Difference]: Start difference. First operand has 278 places, 419 transitions, 4887 flow. Second operand 31 states and 862 transitions. [2025-03-09 01:23:06,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 790 transitions, 9702 flow [2025-03-09 01:23:10,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 790 transitions, 8979 flow, removed 300 selfloop flow, removed 7 redundant places. [2025-03-09 01:23:10,020 INFO L231 Difference]: Finished difference. Result has 309 places, 557 transitions, 6699 flow [2025-03-09 01:23:10,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=4322, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=6699, PETRI_PLACES=309, PETRI_TRANSITIONS=557} [2025-03-09 01:23:10,022 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 229 predicate places. [2025-03-09 01:23:10,022 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 557 transitions, 6699 flow [2025-03-09 01:23:10,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 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:23:10,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:10,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:10,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:23:10,022 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:23:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash 450557292, now seen corresponding path program 7 times [2025-03-09 01:23:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58919871] [2025-03-09 01:23:10,023 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:23:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:10,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 01:23:10,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 01:23:10,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:10,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58919871] [2025-03-09 01:23:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58919871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231765114] [2025-03-09 01:23:10,461 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:23:10,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:10,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:10,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:23:10,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:23:10,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 01:23:10,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 01:23:10,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:10,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:10,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 01:23:10,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:10,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:23:10,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-03-09 01:23:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:11,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:11,322 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-09 01:23:11,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2025-03-09 01:23:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:23:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231765114] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:11,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:23:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14, 16] total 36 [2025-03-09 01:23:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750998130] [2025-03-09 01:23:11,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:11,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:23:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:11,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:23:11,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:23:11,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:23:11,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 557 transitions, 6699 flow. Second operand has 14 states, 14 states have (on average 21.928571428571427) internal successors, (307), 14 states have internal predecessors, (307), 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:23:11,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:11,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:23:11,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:17,973 INFO L124 PetriNetUnfolderBase]: 21500/32990 cut-off events. [2025-03-09 01:23:17,974 INFO L125 PetriNetUnfolderBase]: For 236970/236970 co-relation queries the response was YES. [2025-03-09 01:23:18,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168314 conditions, 32990 events. 21500/32990 cut-off events. For 236970/236970 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 227251 event pairs, 5856 based on Foata normal form. 2/32970 useless extension candidates. Maximal degree in co-relation 166861. Up to 26160 conditions per place. [2025-03-09 01:23:18,413 INFO L140 encePairwiseOnDemand]: 54/75 looper letters, 610 selfloop transitions, 150 changer transitions 79/843 dead transitions. [2025-03-09 01:23:18,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 843 transitions, 11050 flow [2025-03-09 01:23:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 01:23:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-09 01:23:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 774 transitions. [2025-03-09 01:23:18,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36857142857142855 [2025-03-09 01:23:18,415 INFO L175 Difference]: Start difference. First operand has 309 places, 557 transitions, 6699 flow. Second operand 28 states and 774 transitions. [2025-03-09 01:23:18,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 843 transitions, 11050 flow [2025-03-09 01:23:22,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 843 transitions, 9866 flow, removed 542 selfloop flow, removed 4 redundant places. [2025-03-09 01:23:22,394 INFO L231 Difference]: Finished difference. Result has 341 places, 602 transitions, 6990 flow [2025-03-09 01:23:22,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=6019, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=6990, PETRI_PLACES=341, PETRI_TRANSITIONS=602} [2025-03-09 01:23:22,395 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 261 predicate places. [2025-03-09 01:23:22,395 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 602 transitions, 6990 flow [2025-03-09 01:23:22,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.928571428571427) internal successors, (307), 14 states have internal predecessors, (307), 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:23:22,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:22,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:22,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:23:22,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 01:23:22,596 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:23:22,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1805946586, now seen corresponding path program 8 times [2025-03-09 01:23:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223123959] [2025-03-09 01:23:22,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:22,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-09 01:23:22,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-09 01:23:22,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:22,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:23:22,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:22,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223123959] [2025-03-09 01:23:22,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223123959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:22,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:22,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:23:22,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867698156] [2025-03-09 01:23:22,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:22,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:23:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:22,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:23:22,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:23:23,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 75 [2025-03-09 01:23:23,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 602 transitions, 6990 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 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:23:23,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:23,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 75 [2025-03-09 01:23:23,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:29,634 INFO L124 PetriNetUnfolderBase]: 23350/35837 cut-off events. [2025-03-09 01:23:29,634 INFO L125 PetriNetUnfolderBase]: For 261181/261181 co-relation queries the response was YES. [2025-03-09 01:23:30,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179640 conditions, 35837 events. 23350/35837 cut-off events. For 261181/261181 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 250410 event pairs, 6430 based on Foata normal form. 2/35817 useless extension candidates. Maximal degree in co-relation 179518. Up to 26855 conditions per place. [2025-03-09 01:23:30,393 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 719 selfloop transitions, 158 changer transitions 66/947 dead transitions. [2025-03-09 01:23:30,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 947 transitions, 11922 flow [2025-03-09 01:23:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 01:23:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-09 01:23:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 887 transitions. [2025-03-09 01:23:30,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3695833333333333 [2025-03-09 01:23:30,395 INFO L175 Difference]: Start difference. First operand has 341 places, 602 transitions, 6990 flow. Second operand 32 states and 887 transitions. [2025-03-09 01:23:30,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 947 transitions, 11922 flow [2025-03-09 01:23:33,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 947 transitions, 11658 flow, removed 59 selfloop flow, removed 19 redundant places. [2025-03-09 01:23:33,930 INFO L231 Difference]: Finished difference. Result has 367 places, 686 transitions, 8502 flow [2025-03-09 01:23:33,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=6776, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=8502, PETRI_PLACES=367, PETRI_TRANSITIONS=686} [2025-03-09 01:23:33,930 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 287 predicate places. [2025-03-09 01:23:33,930 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 686 transitions, 8502 flow [2025-03-09 01:23:33,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 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:23:33,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:33,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:33,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:23:33,931 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:23:33,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:33,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2020466418, now seen corresponding path program 9 times [2025-03-09 01:23:33,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:33,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804581014] [2025-03-09 01:23:33,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:23:33,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:33,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 3 equivalence classes. [2025-03-09 01:23:33,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 46 of 59 statements. [2025-03-09 01:23:33,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:23:33,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:23:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804581014] [2025-03-09 01:23:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804581014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:34,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:23:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071842558] [2025-03-09 01:23:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:34,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:23:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:34,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:23:34,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110