./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-array-int-subst.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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:22:36,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:22:36,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:22:36,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:22:36,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:22:36,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:22:36,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:22:36,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:22:36,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:22:36,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:22:36,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:22:36,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:22:36,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:22:36,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:22:36,622 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:22:36,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:22:36,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:22:36,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:22:36,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:22:36,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:22:36,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:22:36,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:22:36,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:22:36,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:22:36,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:22:36,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:22:36,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:22:36,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:22:36,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:22:36,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:22:36,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:22:36,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:22:36,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:22:36,626 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-03-17 14:22:36,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:22:36,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:22:36,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:22:36,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:22:36,829 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:22:36,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-17 14:22:37,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ddd285cf/3779dfb191c14569b8c7b978142dc7b5/FLAG05e332798 [2025-03-17 14:22:38,153 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:22:38,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-17 14:22:38,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ddd285cf/3779dfb191c14569b8c7b978142dc7b5/FLAG05e332798 [2025-03-17 14:22:38,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ddd285cf/3779dfb191c14569b8c7b978142dc7b5 [2025-03-17 14:22:38,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:22:38,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:22:38,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:22:38,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:22:38,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:22:38,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f7063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38, skipping insertion in model container [2025-03-17 14:22:38,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:22:38,309 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-17 14:22:38,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:22:38,317 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:22:38,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:22:38,348 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:22:38,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38 WrapperNode [2025-03-17 14:22:38,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:22:38,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:22:38,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:22:38,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:22:38,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,374 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 258 [2025-03-17 14:22:38,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:22:38,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:22:38,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:22:38,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:22:38,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,400 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-17 14:22:38,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:22:38,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:22:38,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:22:38,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:22:38,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (1/1) ... [2025-03-17 14:22:38,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:22:38,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:38,438 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-17 14:22:38,440 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-17 14:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:22:38,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:22:38,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:22:38,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:22:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:22:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:22:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:22:38,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:22:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:22:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:22:38,459 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:22:38,538 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:22:38,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:22:38,862 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:22:38,862 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:22:39,065 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:22:39,065 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:22:39,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:22:39 BoogieIcfgContainer [2025-03-17 14:22:39,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:22:39,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:22:39,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:22:39,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:22:39,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:22:38" (1/3) ... [2025-03-17 14:22:39,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7567102b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:22:39, skipping insertion in model container [2025-03-17 14:22:39,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:22:38" (2/3) ... [2025-03-17 14:22:39,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7567102b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:22:39, skipping insertion in model container [2025-03-17 14:22:39,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:22:39" (3/3) ... [2025-03-17 14:22:39,073 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-03-17 14:22:39,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:22:39,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 79 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-17 14:22:39,085 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:22:39,141 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 14:22:39,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 195 flow [2025-03-17 14:22:39,197 INFO L124 PetriNetUnfolderBase]: 9/84 cut-off events. [2025-03-17 14:22:39,198 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:22:39,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 9/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 272 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-03-17 14:22:39,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 195 flow [2025-03-17 14:22:39,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 184 flow [2025-03-17 14:22:39,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:22:39,223 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;@58db5f12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:22:39,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-17 14:22:39,227 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:22:39,227 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:22:39,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:22:39,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:39,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:22:39,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:39,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash 767757, now seen corresponding path program 1 times [2025-03-17 14:22:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:39,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378693077] [2025-03-17 14:22:39,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:39,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:22:39,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:22:39,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:39,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:39,415 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-17 14:22:39,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:39,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378693077] [2025-03-17 14:22:39,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378693077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:39,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:22:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471189972] [2025-03-17 14:22:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:39,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:22:39,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:39,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:22:39,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:22:39,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-17 14:22:39,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-17 14:22:39,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:39,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-17 14:22:39,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:39,737 INFO L124 PetriNetUnfolderBase]: 866/1675 cut-off events. [2025-03-17 14:22:39,737 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-17 14:22:39,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1675 events. 866/1675 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10489 event pairs, 514 based on Foata normal form. 1/1145 useless extension candidates. Maximal degree in co-relation 2696. Up to 1169 conditions per place. [2025-03-17 14:22:39,756 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 33 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-03-17 14:22:39,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 244 flow [2025-03-17 14:22:39,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:22:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:22:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-17 14:22:39,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-03-17 14:22:39,765 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 184 flow. Second operand 3 states and 180 transitions. [2025-03-17 14:22:39,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 244 flow [2025-03-17 14:22:39,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 232 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:22:39,772 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 166 flow [2025-03-17 14:22:39,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-03-17 14:22:39,775 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-03-17 14:22:39,777 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 166 flow [2025-03-17 14:22:39,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-17 14:22:39,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:39,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:22:39,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:22:39,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:39,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash 767758, now seen corresponding path program 1 times [2025-03-17 14:22:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:39,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975321202] [2025-03-17 14:22:39,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:39,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:39,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:22:39,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:22:39,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:39,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:39,968 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-17 14:22:39,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:39,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975321202] [2025-03-17 14:22:39,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975321202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:39,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:39,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:22:39,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33963559] [2025-03-17 14:22:39,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:39,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:22:39,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:39,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:22:39,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:22:40,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-17 14:22:40,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-17 14:22:40,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:40,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-17 14:22:40,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:40,232 INFO L124 PetriNetUnfolderBase]: 866/1674 cut-off events. [2025-03-17 14:22:40,233 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-17 14:22:40,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2888 conditions, 1674 events. 866/1674 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10459 event pairs, 514 based on Foata normal form. 0/1142 useless extension candidates. Maximal degree in co-relation 2859. Up to 1177 conditions per place. [2025-03-17 14:22:40,241 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 33 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-03-17 14:22:40,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 77 transitions, 238 flow [2025-03-17 14:22:40,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:22:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:22:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2025-03-17 14:22:40,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494252873563219 [2025-03-17 14:22:40,243 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 166 flow. Second operand 4 states and 226 transitions. [2025-03-17 14:22:40,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 77 transitions, 238 flow [2025-03-17 14:22:40,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:22:40,244 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 168 flow [2025-03-17 14:22:40,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2025-03-17 14:22:40,245 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-03-17 14:22:40,245 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 168 flow [2025-03-17 14:22:40,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-17 14:22:40,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:40,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:22:40,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:22:40,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:40,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash 23802982, now seen corresponding path program 1 times [2025-03-17 14:22:40,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:40,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021057696] [2025-03-17 14:22:40,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:40,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:40,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:22:40,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:22:40,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:40,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:40,440 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-17 14:22:40,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:40,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021057696] [2025-03-17 14:22:40,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021057696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:40,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:40,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:22:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31930639] [2025-03-17 14:22:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:40,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:40,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:40,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:40,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-17 14:22:40,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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-17 14:22:40,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:40,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-17 14:22:40,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:40,771 INFO L124 PetriNetUnfolderBase]: 868/1680 cut-off events. [2025-03-17 14:22:40,771 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-17 14:22:40,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2905 conditions, 1680 events. 868/1680 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10489 event pairs, 514 based on Foata normal form. 0/1145 useless extension candidates. Maximal degree in co-relation 2881. Up to 1180 conditions per place. [2025-03-17 14:22:40,780 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 36 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2025-03-17 14:22:40,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 272 flow [2025-03-17 14:22:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:22:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:22:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2025-03-17 14:22:40,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6413793103448275 [2025-03-17 14:22:40,782 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 168 flow. Second operand 5 states and 279 transitions. [2025-03-17 14:22:40,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 272 flow [2025-03-17 14:22:40,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:22:40,785 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 213 flow [2025-03-17 14:22:40,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2025-03-17 14:22:40,785 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2025-03-17 14:22:40,785 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 213 flow [2025-03-17 14:22:40,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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-17 14:22:40,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:40,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:22:40,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:22:40,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:40,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash 737895039, now seen corresponding path program 1 times [2025-03-17 14:22:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:40,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140687421] [2025-03-17 14:22:40,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:40,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:22:40,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:22:40,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:40,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:40,979 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-17 14:22:40,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:40,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140687421] [2025-03-17 14:22:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140687421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:40,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:22:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235692786] [2025-03-17 14:22:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:40,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:40,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:40,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:41,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-17 14:22:41,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-17 14:22:41,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:41,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-17 14:22:41,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:41,294 INFO L124 PetriNetUnfolderBase]: 869/1683 cut-off events. [2025-03-17 14:22:41,294 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-17 14:22:41,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1683 events. 869/1683 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10510 event pairs, 514 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 2883. Up to 1183 conditions per place. [2025-03-17 14:22:41,301 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 37 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2025-03-17 14:22:41,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 311 flow [2025-03-17 14:22:41,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:22:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:22:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2025-03-17 14:22:41,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6413793103448275 [2025-03-17 14:22:41,302 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 213 flow. Second operand 5 states and 279 transitions. [2025-03-17 14:22:41,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 311 flow [2025-03-17 14:22:41,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:22:41,304 INFO L231 Difference]: Finished difference. Result has 84 places, 86 transitions, 255 flow [2025-03-17 14:22:41,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=84, PETRI_TRANSITIONS=86} [2025-03-17 14:22:41,304 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 0 predicate places. [2025-03-17 14:22:41,304 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 86 transitions, 255 flow [2025-03-17 14:22:41,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-17 14:22:41,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:41,305 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:22:41,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:22:41,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1399853220, now seen corresponding path program 1 times [2025-03-17 14:22:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850314213] [2025-03-17 14:22:41,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:41,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:22:41,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:22:41,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:41,472 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-17 14:22:41,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:41,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850314213] [2025-03-17 14:22:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850314213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:41,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804415339] [2025-03-17 14:22:41,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:41,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:41,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:41,475 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-17 14:22:41,477 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-17 14:22:41,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:22:41,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:22:41,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:41,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:41,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:22:41,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:41,577 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-17 14:22:41,719 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-17 14:22:41,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:41,837 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-17 14:22:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804415339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:22:41,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:22:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:22:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024548184] [2025-03-17 14:22:41,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:22:41,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:22:41,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:41,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:22:41,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:22:42,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2025-03-17 14:22:42,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 86 transitions, 255 flow. Second operand has 13 states, 13 states have (on average 47.30769230769231) internal successors, (615), 13 states have internal predecessors, (615), 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-17 14:22:42,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:42,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2025-03-17 14:22:42,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:43,127 INFO L124 PetriNetUnfolderBase]: 992/2096 cut-off events. [2025-03-17 14:22:43,127 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-17 14:22:43,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3544 conditions, 2096 events. 992/2096 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14561 event pairs, 604 based on Foata normal form. 0/1393 useless extension candidates. Maximal degree in co-relation 3484. Up to 1342 conditions per place. [2025-03-17 14:22:43,138 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 34 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2025-03-17 14:22:43,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 384 flow [2025-03-17 14:22:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:22:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:22:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 465 transitions. [2025-03-17 14:22:43,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5938697318007663 [2025-03-17 14:22:43,141 INFO L175 Difference]: Start difference. First operand has 84 places, 86 transitions, 255 flow. Second operand 9 states and 465 transitions. [2025-03-17 14:22:43,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 384 flow [2025-03-17 14:22:43,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 91 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:22:43,143 INFO L231 Difference]: Finished difference. Result has 89 places, 91 transitions, 308 flow [2025-03-17 14:22:43,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=89, PETRI_TRANSITIONS=91} [2025-03-17 14:22:43,143 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-03-17 14:22:43,144 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 308 flow [2025-03-17 14:22:43,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.30769230769231) internal successors, (615), 13 states have internal predecessors, (615), 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-17 14:22:43,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:43,144 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-17 14:22:43,151 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-17 14:22:43,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:43,345 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:43,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 447553463, now seen corresponding path program 1 times [2025-03-17 14:22:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080276420] [2025-03-17 14:22:43,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:43,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:22:43,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:22:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:43,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:22:43,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:43,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080276420] [2025-03-17 14:22:43,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080276420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:43,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166430850] [2025-03-17 14:22:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:43,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:43,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:43,568 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-17 14:22:43,569 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-17 14:22:43,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:22:43,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:22:43,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:43,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:43,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:22:43,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:43,648 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-17 14:22:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:22:43,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:22:43,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166430850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:22:43,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:22:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:22:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958733764] [2025-03-17 14:22:43,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:22:43,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:22:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:43,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:22:43,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:22:44,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-17 14:22:44,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 308 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 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-17 14:22:44,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:44,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-17 14:22:44,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:44,864 INFO L124 PetriNetUnfolderBase]: 871/1687 cut-off events. [2025-03-17 14:22:44,864 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 14:22:44,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2976 conditions, 1687 events. 871/1687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10498 event pairs, 514 based on Foata normal form. 0/1158 useless extension candidates. Maximal degree in co-relation 2913. Up to 1178 conditions per place. [2025-03-17 14:22:44,873 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 31 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2025-03-17 14:22:44,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 404 flow [2025-03-17 14:22:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:22:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:22:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2025-03-17 14:22:44,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2025-03-17 14:22:44,875 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 308 flow. Second operand 7 states and 371 transitions. [2025-03-17 14:22:44,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 404 flow [2025-03-17 14:22:44,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 90 transitions, 358 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-17 14:22:44,878 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 296 flow [2025-03-17 14:22:44,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2025-03-17 14:22:44,880 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2025-03-17 14:22:44,880 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 296 flow [2025-03-17 14:22:44,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 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-17 14:22:44,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:44,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:44,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:22:45,085 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-17 14:22:45,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:45,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash 992670573, now seen corresponding path program 1 times [2025-03-17 14:22:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:45,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723067624] [2025-03-17 14:22:45,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:45,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:22:45,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:22:45,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:45,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:22:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:45,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723067624] [2025-03-17 14:22:45,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723067624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:45,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:45,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:22:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870454017] [2025-03-17 14:22:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:45,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:45,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:45,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:45,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:22:45,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-17 14:22:45,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:45,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:22:45,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:45,401 INFO L124 PetriNetUnfolderBase]: 1484/2978 cut-off events. [2025-03-17 14:22:45,401 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-17 14:22:45,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5191 conditions, 2978 events. 1484/2978 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21326 event pairs, 669 based on Foata normal form. 62/2190 useless extension candidates. Maximal degree in co-relation 3501. Up to 1355 conditions per place. [2025-03-17 14:22:45,411 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 88 selfloop transitions, 15 changer transitions 0/142 dead transitions. [2025-03-17 14:22:45,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 142 transitions, 672 flow [2025-03-17 14:22:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:22:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:22:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 381 transitions. [2025-03-17 14:22:45,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7298850574712644 [2025-03-17 14:22:45,413 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 296 flow. Second operand 6 states and 381 transitions. [2025-03-17 14:22:45,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 142 transitions, 672 flow [2025-03-17 14:22:45,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 142 transitions, 608 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 14:22:45,416 INFO L231 Difference]: Finished difference. Result has 90 places, 102 transitions, 386 flow [2025-03-17 14:22:45,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=90, PETRI_TRANSITIONS=102} [2025-03-17 14:22:45,418 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 6 predicate places. [2025-03-17 14:22:45,418 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 102 transitions, 386 flow [2025-03-17 14:22:45,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-17 14:22:45,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:45,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:45,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:22:45,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:45,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash 406987614, now seen corresponding path program 1 times [2025-03-17 14:22:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094942224] [2025-03-17 14:22:45,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:45,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:22:45,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:22:45,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:45,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:22:45,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:45,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094942224] [2025-03-17 14:22:45,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094942224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:45,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:45,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:22:45,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148990133] [2025-03-17 14:22:45,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:45,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:45,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:45,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:45,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:45,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:22:45,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 102 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-17 14:22:45,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:45,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:22:45,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:45,728 INFO L124 PetriNetUnfolderBase]: 1239/2609 cut-off events. [2025-03-17 14:22:45,728 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-17 14:22:45,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4636 conditions, 2609 events. 1239/2609 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18680 event pairs, 652 based on Foata normal form. 41/1883 useless extension candidates. Maximal degree in co-relation 3618. Up to 1371 conditions per place. [2025-03-17 14:22:45,738 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 81 selfloop transitions, 15 changer transitions 0/135 dead transitions. [2025-03-17 14:22:45,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 135 transitions, 665 flow [2025-03-17 14:22:45,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:22:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:22:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 374 transitions. [2025-03-17 14:22:45,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7164750957854407 [2025-03-17 14:22:45,740 INFO L175 Difference]: Start difference. First operand has 90 places, 102 transitions, 386 flow. Second operand 6 states and 374 transitions. [2025-03-17 14:22:45,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 135 transitions, 665 flow [2025-03-17 14:22:45,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 661 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:22:45,742 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 431 flow [2025-03-17 14:22:45,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2025-03-17 14:22:45,743 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 12 predicate places. [2025-03-17 14:22:45,743 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 431 flow [2025-03-17 14:22:45,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-17 14:22:45,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:45,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:45,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:22:45,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:45,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1400174982, now seen corresponding path program 1 times [2025-03-17 14:22:45,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:45,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560289122] [2025-03-17 14:22:45,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:45,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:22:45,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:22:45,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:45,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560289122] [2025-03-17 14:22:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560289122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:45,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:22:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625753919] [2025-03-17 14:22:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:45,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:45,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:22:45,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-17 14:22:45,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:45,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:22:45,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:46,125 INFO L124 PetriNetUnfolderBase]: 1892/4161 cut-off events. [2025-03-17 14:22:46,125 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2025-03-17 14:22:46,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7646 conditions, 4161 events. 1892/4161 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 33771 event pairs, 841 based on Foata normal form. 62/3015 useless extension candidates. Maximal degree in co-relation 5469. Up to 1650 conditions per place. [2025-03-17 14:22:46,141 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 102 selfloop transitions, 12 changer transitions 0/153 dead transitions. [2025-03-17 14:22:46,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 153 transitions, 838 flow [2025-03-17 14:22:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:22:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:22:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 377 transitions. [2025-03-17 14:22:46,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-03-17 14:22:46,142 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 431 flow. Second operand 6 states and 377 transitions. [2025-03-17 14:22:46,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 153 transitions, 838 flow [2025-03-17 14:22:46,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 153 transitions, 811 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:22:46,146 INFO L231 Difference]: Finished difference. Result has 100 places, 109 transitions, 499 flow [2025-03-17 14:22:46,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=499, PETRI_PLACES=100, PETRI_TRANSITIONS=109} [2025-03-17 14:22:46,146 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 16 predicate places. [2025-03-17 14:22:46,146 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 109 transitions, 499 flow [2025-03-17 14:22:46,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-17 14:22:46,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:46,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:46,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:22:46,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:46,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash 950822020, now seen corresponding path program 1 times [2025-03-17 14:22:46,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:46,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440208778] [2025-03-17 14:22:46,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:46,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:46,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:22:46,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:22:46,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:46,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:22:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:46,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440208778] [2025-03-17 14:22:46,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440208778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:46,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:46,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:22:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008151065] [2025-03-17 14:22:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:46,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:22:46,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:46,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:22:46,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:22:46,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-17 14:22:46,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 109 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-17 14:22:46,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:46,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-17 14:22:46,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:46,582 INFO L124 PetriNetUnfolderBase]: 2659/5312 cut-off events. [2025-03-17 14:22:46,582 INFO L125 PetriNetUnfolderBase]: For 1605/1605 co-relation queries the response was YES. [2025-03-17 14:22:46,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10285 conditions, 5312 events. 2659/5312 cut-off events. For 1605/1605 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 41255 event pairs, 1841 based on Foata normal form. 0/4138 useless extension candidates. Maximal degree in co-relation 5481. Up to 3733 conditions per place. [2025-03-17 14:22:46,600 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 64 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2025-03-17 14:22:46,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 637 flow [2025-03-17 14:22:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:22:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:22:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2025-03-17 14:22:46,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5471264367816092 [2025-03-17 14:22:46,601 INFO L175 Difference]: Start difference. First operand has 100 places, 109 transitions, 499 flow. Second operand 5 states and 238 transitions. [2025-03-17 14:22:46,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 637 flow [2025-03-17 14:22:46,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 105 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:22:46,605 INFO L231 Difference]: Finished difference. Result has 99 places, 105 transitions, 504 flow [2025-03-17 14:22:46,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=99, PETRI_TRANSITIONS=105} [2025-03-17 14:22:46,606 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 15 predicate places. [2025-03-17 14:22:46,606 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 105 transitions, 504 flow [2025-03-17 14:22:46,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-17 14:22:46,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:46,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:46,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:22:46,607 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:46,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash 205039773, now seen corresponding path program 1 times [2025-03-17 14:22:46,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:46,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144797391] [2025-03-17 14:22:46,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:46,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:22:46,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:22:46,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:46,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:46,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:46,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144797391] [2025-03-17 14:22:46,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144797391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:46,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:46,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:22:46,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396235941] [2025-03-17 14:22:46,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:46,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:46,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:46,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:46,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:46,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:22:46,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 105 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 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-17 14:22:46,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:46,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:22:46,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:46,949 INFO L124 PetriNetUnfolderBase]: 1652/3584 cut-off events. [2025-03-17 14:22:46,950 INFO L125 PetriNetUnfolderBase]: For 1286/1286 co-relation queries the response was YES. [2025-03-17 14:22:46,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6958 conditions, 3584 events. 1652/3584 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 27725 event pairs, 938 based on Foata normal form. 58/2735 useless extension candidates. Maximal degree in co-relation 4077. Up to 1792 conditions per place. [2025-03-17 14:22:46,963 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 96 selfloop transitions, 11 changer transitions 0/142 dead transitions. [2025-03-17 14:22:46,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 142 transitions, 855 flow [2025-03-17 14:22:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:22:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:22:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 369 transitions. [2025-03-17 14:22:46,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2025-03-17 14:22:46,965 INFO L175 Difference]: Start difference. First operand has 99 places, 105 transitions, 504 flow. Second operand 6 states and 369 transitions. [2025-03-17 14:22:46,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 142 transitions, 855 flow [2025-03-17 14:22:46,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 142 transitions, 841 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:22:46,968 INFO L231 Difference]: Finished difference. Result has 103 places, 106 transitions, 525 flow [2025-03-17 14:22:46,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=103, PETRI_TRANSITIONS=106} [2025-03-17 14:22:46,969 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 19 predicate places. [2025-03-17 14:22:46,969 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 106 transitions, 525 flow [2025-03-17 14:22:46,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 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-17 14:22:46,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:46,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:22:46,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:46,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 950822021, now seen corresponding path program 1 times [2025-03-17 14:22:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:46,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366661349] [2025-03-17 14:22:46,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:46,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:22:46,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:22:46,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:46,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:47,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366661349] [2025-03-17 14:22:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366661349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987173155] [2025-03-17 14:22:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:47,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:47,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:47,143 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-17 14:22:47,144 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-17 14:22:47,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:22:47,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:22:47,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:47,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:47,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:22:47,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:47,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:22:47,286 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:22:47,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 14:22:47,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:22:47,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:22:47,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:22:47,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:22:47,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:22:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:47,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:47,557 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 100 treesize of output 96 [2025-03-17 14:22:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987173155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:22:47,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:22:47,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 14:22:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845355359] [2025-03-17 14:22:47,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:22:47,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:22:47,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:47,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:22:47,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:22:49,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 87 [2025-03-17 14:22:49,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 525 flow. Second operand has 16 states, 16 states have (on average 38.9375) internal successors, (623), 16 states have internal predecessors, (623), 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-17 14:22:49,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:49,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 87 [2025-03-17 14:22:49,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:49,844 INFO L124 PetriNetUnfolderBase]: 4383/8023 cut-off events. [2025-03-17 14:22:49,844 INFO L125 PetriNetUnfolderBase]: For 1991/1991 co-relation queries the response was YES. [2025-03-17 14:22:49,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15929 conditions, 8023 events. 4383/8023 cut-off events. For 1991/1991 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 59904 event pairs, 1444 based on Foata normal form. 0/6357 useless extension candidates. Maximal degree in co-relation 12329. Up to 2488 conditions per place. [2025-03-17 14:22:49,868 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 122 selfloop transitions, 25 changer transitions 0/177 dead transitions. [2025-03-17 14:22:49,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 177 transitions, 1009 flow [2025-03-17 14:22:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:22:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:22:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 465 transitions. [2025-03-17 14:22:49,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5938697318007663 [2025-03-17 14:22:49,871 INFO L175 Difference]: Start difference. First operand has 103 places, 106 transitions, 525 flow. Second operand 9 states and 465 transitions. [2025-03-17 14:22:49,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 177 transitions, 1009 flow [2025-03-17 14:22:49,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 991 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:22:49,876 INFO L231 Difference]: Finished difference. Result has 109 places, 108 transitions, 580 flow [2025-03-17 14:22:49,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=580, PETRI_PLACES=109, PETRI_TRANSITIONS=108} [2025-03-17 14:22:49,877 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 25 predicate places. [2025-03-17 14:22:49,877 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 580 flow [2025-03-17 14:22:49,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 38.9375) internal successors, (623), 16 states have internal predecessors, (623), 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-17 14:22:49,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:49,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:49,885 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-17 14:22:50,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:50,081 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:50,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1176700728, now seen corresponding path program 1 times [2025-03-17 14:22:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:50,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291803869] [2025-03-17 14:22:50,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:50,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:22:50,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:22:50,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:50,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:50,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291803869] [2025-03-17 14:22:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291803869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:50,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:22:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205159778] [2025-03-17 14:22:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:50,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:50,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:50,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:50,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:22:50,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 580 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 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-17 14:22:50,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:50,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:22:50,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:50,629 INFO L124 PetriNetUnfolderBase]: 3949/8623 cut-off events. [2025-03-17 14:22:50,629 INFO L125 PetriNetUnfolderBase]: For 4966/5018 co-relation queries the response was YES. [2025-03-17 14:22:50,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17560 conditions, 8623 events. 3949/8623 cut-off events. For 4966/5018 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 76226 event pairs, 2029 based on Foata normal form. 162/6800 useless extension candidates. Maximal degree in co-relation 11627. Up to 3666 conditions per place. [2025-03-17 14:22:50,664 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 105 selfloop transitions, 15 changer transitions 0/155 dead transitions. [2025-03-17 14:22:50,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 155 transitions, 1018 flow [2025-03-17 14:22:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:22:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:22:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-03-17 14:22:50,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379310344827587 [2025-03-17 14:22:50,666 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 580 flow. Second operand 5 states and 321 transitions. [2025-03-17 14:22:50,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 155 transitions, 1018 flow [2025-03-17 14:22:50,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 155 transitions, 992 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-17 14:22:50,673 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 616 flow [2025-03-17 14:22:50,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=616, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2025-03-17 14:22:50,673 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 30 predicate places. [2025-03-17 14:22:50,673 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 616 flow [2025-03-17 14:22:50,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 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-17 14:22:50,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:50,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:50,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:22:50,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:50,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:50,674 INFO L85 PathProgramCache]: Analyzing trace with hash -589287711, now seen corresponding path program 1 times [2025-03-17 14:22:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925477618] [2025-03-17 14:22:50,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:50,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:22:50,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:22:50,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:50,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:50,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:50,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925477618] [2025-03-17 14:22:50,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925477618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:50,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:22:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453730198] [2025-03-17 14:22:50,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:50,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:22:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:50,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:22:50,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:22:50,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 87 [2025-03-17 14:22:50,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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-17 14:22:50,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:50,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 87 [2025-03-17 14:22:50,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:51,414 INFO L124 PetriNetUnfolderBase]: 5465/10655 cut-off events. [2025-03-17 14:22:51,414 INFO L125 PetriNetUnfolderBase]: For 6994/6994 co-relation queries the response was YES. [2025-03-17 14:22:51,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23194 conditions, 10655 events. 5465/10655 cut-off events. For 6994/6994 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 88580 event pairs, 4187 based on Foata normal form. 0/9241 useless extension candidates. Maximal degree in co-relation 18716. Up to 7899 conditions per place. [2025-03-17 14:22:51,451 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 65 selfloop transitions, 12 changer transitions 0/106 dead transitions. [2025-03-17 14:22:51,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 106 transitions, 762 flow [2025-03-17 14:22:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:22:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:22:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2025-03-17 14:22:51,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5563218390804597 [2025-03-17 14:22:51,452 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 616 flow. Second operand 5 states and 242 transitions. [2025-03-17 14:22:51,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 106 transitions, 762 flow [2025-03-17 14:22:51,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 106 transitions, 753 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:22:51,459 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 623 flow [2025-03-17 14:22:51,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=623, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2025-03-17 14:22:51,459 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 29 predicate places. [2025-03-17 14:22:51,459 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 623 flow [2025-03-17 14:22:51,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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-17 14:22:51,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:51,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:51,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:22:51,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:51,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:51,460 INFO L85 PathProgramCache]: Analyzing trace with hash -589287710, now seen corresponding path program 1 times [2025-03-17 14:22:51,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:51,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118086614] [2025-03-17 14:22:51,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:51,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:22:51,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:22:51,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:51,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:51,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118086614] [2025-03-17 14:22:51,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118086614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:51,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442334699] [2025-03-17 14:22:51,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:51,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:51,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:51,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-17 14:22:51,572 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-17 14:22:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:22:51,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:22:51,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:51,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:51,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:22:51,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:51,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:22:51,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:22:51,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:22:51,668 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:22:51,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:22:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:51,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:51,763 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 52 treesize of output 48 [2025-03-17 14:22:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442334699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:22:51,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:22:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 14:22:51,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853823995] [2025-03-17 14:22:51,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:22:51,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:22:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:51,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:22:51,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:22:52,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 87 [2025-03-17 14:22:52,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 623 flow. Second operand has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 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-17 14:22:52,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:52,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 87 [2025-03-17 14:22:52,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:53,094 INFO L124 PetriNetUnfolderBase]: 4388/8098 cut-off events. [2025-03-17 14:22:53,095 INFO L125 PetriNetUnfolderBase]: For 5741/5741 co-relation queries the response was YES. [2025-03-17 14:22:53,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18374 conditions, 8098 events. 4388/8098 cut-off events. For 5741/5741 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 61490 event pairs, 1344 based on Foata normal form. 0/6981 useless extension candidates. Maximal degree in co-relation 14558. Up to 2282 conditions per place. [2025-03-17 14:22:53,120 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 123 selfloop transitions, 27 changer transitions 0/179 dead transitions. [2025-03-17 14:22:53,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 179 transitions, 1185 flow [2025-03-17 14:22:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:22:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:22:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 514 transitions. [2025-03-17 14:22:53,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6564495530012772 [2025-03-17 14:22:53,121 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 623 flow. Second operand 9 states and 514 transitions. [2025-03-17 14:22:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 179 transitions, 1185 flow [2025-03-17 14:22:53,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 179 transitions, 1165 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:22:53,129 INFO L231 Difference]: Finished difference. Result has 119 places, 108 transitions, 689 flow [2025-03-17 14:22:53,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=689, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2025-03-17 14:22:53,129 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 35 predicate places. [2025-03-17 14:22:53,129 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 108 transitions, 689 flow [2025-03-17 14:22:53,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 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-17 14:22:53,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:53,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:53,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:22:53,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:22:53,334 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:53,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash -768317733, now seen corresponding path program 1 times [2025-03-17 14:22:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:53,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050935669] [2025-03-17 14:22:53,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:53,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:22:53,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:22:53,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:53,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:22:53,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050935669] [2025-03-17 14:22:53,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050935669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:53,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:53,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:22:53,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876617798] [2025-03-17 14:22:53,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:53,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:53,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:53,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:53,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:22:53,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 689 flow. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:22:53,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:53,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:22:53,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:53,782 INFO L124 PetriNetUnfolderBase]: 3441/7083 cut-off events. [2025-03-17 14:22:53,782 INFO L125 PetriNetUnfolderBase]: For 7644/7732 co-relation queries the response was YES. [2025-03-17 14:22:53,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16208 conditions, 7083 events. 3441/7083 cut-off events. For 7644/7732 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 57463 event pairs, 2101 based on Foata normal form. 94/5852 useless extension candidates. Maximal degree in co-relation 12515. Up to 3664 conditions per place. [2025-03-17 14:22:53,805 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 100 selfloop transitions, 15 changer transitions 0/146 dead transitions. [2025-03-17 14:22:53,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 146 transitions, 1123 flow [2025-03-17 14:22:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:22:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:22:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2025-03-17 14:22:53,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7218390804597701 [2025-03-17 14:22:53,806 INFO L175 Difference]: Start difference. First operand has 119 places, 108 transitions, 689 flow. Second operand 5 states and 314 transitions. [2025-03-17 14:22:53,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 146 transitions, 1123 flow [2025-03-17 14:22:53,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 146 transitions, 1056 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-17 14:22:53,814 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 690 flow [2025-03-17 14:22:53,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2025-03-17 14:22:53,814 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 35 predicate places. [2025-03-17 14:22:53,814 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 690 flow [2025-03-17 14:22:53,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:22:53,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:53,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:53,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:22:53,814 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:53,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash -857392448, now seen corresponding path program 1 times [2025-03-17 14:22:53,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:53,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437675424] [2025-03-17 14:22:53,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:53,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:53,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:22:53,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:22:53,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:53,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:22:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437675424] [2025-03-17 14:22:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437675424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175389816] [2025-03-17 14:22:53,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:53,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:53,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:53,987 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-17 14:22:53,989 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-17 14:22:54,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:22:54,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:22:54,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:54,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:54,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:22:54,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:54,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:22:54,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:22:54,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:22:54,108 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:22:54,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 14:22:54,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:22:54,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:22:54,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:22:54,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:22:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:54,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:54,293 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 100 treesize of output 96 [2025-03-17 14:22:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175389816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:22:54,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:22:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 14:22:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431463075] [2025-03-17 14:22:54,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:22:54,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:22:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:54,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:22:54,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:22:55,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 87 [2025-03-17 14:22:55,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 690 flow. Second operand has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 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-17 14:22:55,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:55,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 87 [2025-03-17 14:22:55,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:56,822 INFO L124 PetriNetUnfolderBase]: 9060/16711 cut-off events. [2025-03-17 14:22:56,823 INFO L125 PetriNetUnfolderBase]: For 14182/14366 co-relation queries the response was YES. [2025-03-17 14:22:56,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37197 conditions, 16711 events. 9060/16711 cut-off events. For 14182/14366 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 137948 event pairs, 2447 based on Foata normal form. 0/13895 useless extension candidates. Maximal degree in co-relation 33621. Up to 5173 conditions per place. [2025-03-17 14:22:56,890 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 135 selfloop transitions, 27 changer transitions 0/187 dead transitions. [2025-03-17 14:22:56,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 187 transitions, 1315 flow [2025-03-17 14:22:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:22:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:22:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 461 transitions. [2025-03-17 14:22:56,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5887611749680716 [2025-03-17 14:22:56,891 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 690 flow. Second operand 9 states and 461 transitions. [2025-03-17 14:22:56,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 187 transitions, 1315 flow [2025-03-17 14:22:56,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 187 transitions, 1291 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:22:56,902 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 740 flow [2025-03-17 14:22:56,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=740, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2025-03-17 14:22:56,903 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 42 predicate places. [2025-03-17 14:22:56,903 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 740 flow [2025-03-17 14:22:56,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 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-17 14:22:56,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:56,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:56,909 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-17 14:22:57,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:22:57,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:57,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash -809361384, now seen corresponding path program 1 times [2025-03-17 14:22:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:57,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117773129] [2025-03-17 14:22:57,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:57,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:57,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:22:57,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:22:57,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:57,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117773129] [2025-03-17 14:22:57,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117773129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:57,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:57,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:22:57,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162757176] [2025-03-17 14:22:57,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:57,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:22:57,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:57,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:22:57,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:22:57,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 87 [2025-03-17 14:22:57,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 740 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-17 14:22:57,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:57,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 87 [2025-03-17 14:22:57,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:57,886 INFO L124 PetriNetUnfolderBase]: 6714/12979 cut-off events. [2025-03-17 14:22:57,886 INFO L125 PetriNetUnfolderBase]: For 15016/15304 co-relation queries the response was YES. [2025-03-17 14:22:57,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30497 conditions, 12979 events. 6714/12979 cut-off events. For 15016/15304 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 109093 event pairs, 5340 based on Foata normal form. 0/12017 useless extension candidates. Maximal degree in co-relation 26787. Up to 9711 conditions per place. [2025-03-17 14:22:57,948 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 72 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-03-17 14:22:57,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 107 transitions, 894 flow [2025-03-17 14:22:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:22:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:22:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-03-17 14:22:57,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890804597701149 [2025-03-17 14:22:57,949 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 740 flow. Second operand 4 states and 205 transitions. [2025-03-17 14:22:57,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 107 transitions, 894 flow [2025-03-17 14:22:57,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 107 transitions, 835 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-17 14:22:57,959 INFO L231 Difference]: Finished difference. Result has 119 places, 107 transitions, 691 flow [2025-03-17 14:22:57,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=119, PETRI_TRANSITIONS=107} [2025-03-17 14:22:57,959 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 35 predicate places. [2025-03-17 14:22:57,959 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 107 transitions, 691 flow [2025-03-17 14:22:57,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-17 14:22:57,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:57,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:57,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:22:57,960 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:57,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash -809361383, now seen corresponding path program 1 times [2025-03-17 14:22:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:57,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130769211] [2025-03-17 14:22:57,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:57,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:22:57,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:22:57,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:57,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130769211] [2025-03-17 14:22:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130769211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347564502] [2025-03-17 14:22:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:58,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:58,066 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-17 14:22:58,068 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-17 14:22:58,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:22:58,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:22:58,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:58,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:58,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:22:58,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:58,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:58,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 14:22:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:58,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347564502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:22:58,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:22:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:22:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214374920] [2025-03-17 14:22:58,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:22:58,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:22:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:58,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:22:58,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:22:58,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-17 14:22:58,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 107 transitions, 691 flow. Second operand has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 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-17 14:22:58,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:58,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-17 14:22:58,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:59,228 INFO L124 PetriNetUnfolderBase]: 6180/11072 cut-off events. [2025-03-17 14:22:59,228 INFO L125 PetriNetUnfolderBase]: For 12932/13184 co-relation queries the response was YES. [2025-03-17 14:22:59,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27041 conditions, 11072 events. 6180/11072 cut-off events. For 12932/13184 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 84489 event pairs, 2037 based on Foata normal form. 0/10171 useless extension candidates. Maximal degree in co-relation 23640. Up to 2957 conditions per place. [2025-03-17 14:22:59,283 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 122 selfloop transitions, 27 changer transitions 0/174 dead transitions. [2025-03-17 14:22:59,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 174 transitions, 1271 flow [2025-03-17 14:22:59,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:22:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:22:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 437 transitions. [2025-03-17 14:22:59,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7175697865353038 [2025-03-17 14:22:59,286 INFO L175 Difference]: Start difference. First operand has 119 places, 107 transitions, 691 flow. Second operand 7 states and 437 transitions. [2025-03-17 14:22:59,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 174 transitions, 1271 flow [2025-03-17 14:22:59,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 174 transitions, 1261 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:22:59,299 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 751 flow [2025-03-17 14:22:59,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=751, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2025-03-17 14:22:59,300 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 40 predicate places. [2025-03-17 14:22:59,300 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 751 flow [2025-03-17 14:22:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 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-17 14:22:59,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:59,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:59,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:22:59,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:59,501 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:22:59,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1848687837, now seen corresponding path program 1 times [2025-03-17 14:22:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923557992] [2025-03-17 14:22:59,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:59,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:22:59,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:22:59,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:59,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:22:59,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923557992] [2025-03-17 14:22:59,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923557992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030230437] [2025-03-17 14:22:59,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:59,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:59,612 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-17 14:22:59,613 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-17 14:22:59,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:22:59,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:22:59,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:59,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:59,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:22:59,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:59,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:22:59,688 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-17 14:22:59,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:22:59,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:22:59,719 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:22:59,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:22:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:22:59,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:22:59,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030230437] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:59,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:22:59,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-03-17 14:22:59,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667650866] [2025-03-17 14:22:59,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:59,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:22:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:59,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:22:59,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:23:00,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2025-03-17 14:23:00,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-17 14:23:00,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:23:00,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2025-03-17 14:23:00,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:23:00,987 INFO L124 PetriNetUnfolderBase]: 7909/14464 cut-off events. [2025-03-17 14:23:00,987 INFO L125 PetriNetUnfolderBase]: For 21337/21869 co-relation queries the response was YES. [2025-03-17 14:23:01,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36392 conditions, 14464 events. 7909/14464 cut-off events. For 21337/21869 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 117973 event pairs, 3276 based on Foata normal form. 0/13382 useless extension candidates. Maximal degree in co-relation 31952. Up to 5716 conditions per place. [2025-03-17 14:23:01,060 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 105 selfloop transitions, 26 changer transitions 0/155 dead transitions. [2025-03-17 14:23:01,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 1267 flow [2025-03-17 14:23:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:23:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:23:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 459 transitions. [2025-03-17 14:23:01,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6594827586206896 [2025-03-17 14:23:01,061 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 751 flow. Second operand 8 states and 459 transitions. [2025-03-17 14:23:01,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 1267 flow [2025-03-17 14:23:01,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 155 transitions, 1201 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-17 14:23:01,078 INFO L231 Difference]: Finished difference. Result has 127 places, 107 transitions, 767 flow [2025-03-17 14:23:01,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=767, PETRI_PLACES=127, PETRI_TRANSITIONS=107} [2025-03-17 14:23:01,078 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 43 predicate places. [2025-03-17 14:23:01,078 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 107 transitions, 767 flow [2025-03-17 14:23:01,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-17 14:23:01,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:23:01,078 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:23:01,084 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-17 14:23:01,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:23:01,279 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:23:01,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:23:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1938120181, now seen corresponding path program 1 times [2025-03-17 14:23:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:23:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750459071] [2025-03-17 14:23:01,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:23:01,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:23:01,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:23:01,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:01,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:01,332 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-17 14:23:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:23:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750459071] [2025-03-17 14:23:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750459071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:23:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947512387] [2025-03-17 14:23:01,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:01,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:23:01,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:23:01,335 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-17 14:23:01,336 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-17 14:23:01,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:23:01,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:23:01,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:01,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:01,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:23:01,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:23:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:23:01,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:23:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:23:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947512387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:23:01,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:23:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-17 14:23:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684307009] [2025-03-17 14:23:01,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:23:01,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:23:01,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:23:01,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:23:01,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:23:01,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:23:01,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 107 transitions, 767 flow. Second operand has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 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-17 14:23:01,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:23:01,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:23:01,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:23:04,215 INFO L124 PetriNetUnfolderBase]: 19306/35155 cut-off events. [2025-03-17 14:23:04,215 INFO L125 PetriNetUnfolderBase]: For 57899/59560 co-relation queries the response was YES. [2025-03-17 14:23:04,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92793 conditions, 35155 events. 19306/35155 cut-off events. For 57899/59560 co-relation queries the response was YES. Maximal size of possible extension queue 1439. Compared 328412 event pairs, 6494 based on Foata normal form. 564/34475 useless extension candidates. Maximal degree in co-relation 48805. Up to 7833 conditions per place. [2025-03-17 14:23:04,399 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 268 selfloop transitions, 85 changer transitions 0/380 dead transitions. [2025-03-17 14:23:04,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 380 transitions, 3059 flow [2025-03-17 14:23:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 14:23:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-17 14:23:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1836 transitions. [2025-03-17 14:23:04,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6594827586206896 [2025-03-17 14:23:04,401 INFO L175 Difference]: Start difference. First operand has 127 places, 107 transitions, 767 flow. Second operand 32 states and 1836 transitions. [2025-03-17 14:23:04,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 380 transitions, 3059 flow [2025-03-17 14:23:04,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 380 transitions, 2900 flow, removed 20 selfloop flow, removed 7 redundant places. [2025-03-17 14:23:04,463 INFO L231 Difference]: Finished difference. Result has 158 places, 160 transitions, 1451 flow [2025-03-17 14:23:04,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1451, PETRI_PLACES=158, PETRI_TRANSITIONS=160} [2025-03-17 14:23:04,464 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 74 predicate places. [2025-03-17 14:23:04,464 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 160 transitions, 1451 flow [2025-03-17 14:23:04,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 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-17 14:23:04,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:23:04,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:23:04,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:23:04,664 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,SelfDestructingSolverStorable20 [2025-03-17 14:23:04,664 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:23:04,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:23:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1474747352, now seen corresponding path program 1 times [2025-03-17 14:23:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:23:04,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983725634] [2025-03-17 14:23:04,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:04,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:23:04,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:23:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:23:04,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:04,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:23:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:23:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983725634] [2025-03-17 14:23:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983725634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:23:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409081909] [2025-03-17 14:23:04,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:04,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:23:04,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:23:04,756 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-17 14:23:04,758 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-17 14:23:04,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:23:04,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:23:04,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:04,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:04,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:23:04,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:23:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:23:04,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:23:04,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 14:23:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:23:04,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409081909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:23:04,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:23:04,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:23:04,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044000626] [2025-03-17 14:23:04,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:23:04,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:23:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:23:04,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:23:04,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:23:05,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-17 14:23:05,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 160 transitions, 1451 flow. Second operand has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 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-17 14:23:05,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:23:05,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-17 14:23:05,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:23:08,819 INFO L124 PetriNetUnfolderBase]: 27909/48500 cut-off events. [2025-03-17 14:23:08,819 INFO L125 PetriNetUnfolderBase]: For 93797/97091 co-relation queries the response was YES. [2025-03-17 14:23:09,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127973 conditions, 48500 events. 27909/48500 cut-off events. For 93797/97091 co-relation queries the response was YES. Maximal size of possible extension queue 1957. Compared 449546 event pairs, 9120 based on Foata normal form. 0/47072 useless extension candidates. Maximal degree in co-relation 62043. Up to 12916 conditions per place. [2025-03-17 14:23:09,188 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 179 selfloop transitions, 45 changer transitions 0/249 dead transitions. [2025-03-17 14:23:09,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 249 transitions, 2526 flow [2025-03-17 14:23:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:23:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:23:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 433 transitions. [2025-03-17 14:23:09,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7110016420361248 [2025-03-17 14:23:09,189 INFO L175 Difference]: Start difference. First operand has 158 places, 160 transitions, 1451 flow. Second operand 7 states and 433 transitions. [2025-03-17 14:23:09,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 249 transitions, 2526 flow [2025-03-17 14:23:09,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 249 transitions, 2491 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-17 14:23:09,277 INFO L231 Difference]: Finished difference. Result has 162 places, 161 transitions, 1534 flow [2025-03-17 14:23:09,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1534, PETRI_PLACES=162, PETRI_TRANSITIONS=161} [2025-03-17 14:23:09,278 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 78 predicate places. [2025-03-17 14:23:09,278 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 161 transitions, 1534 flow [2025-03-17 14:23:09,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 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-17 14:23:09,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:23:09,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:23:09,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:23:09,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:23:09,479 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:23:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:23:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 262166342, now seen corresponding path program 1 times [2025-03-17 14:23:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:23:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419271376] [2025-03-17 14:23:09,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:23:09,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:23:09,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:23:09,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:09,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:23:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:23:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419271376] [2025-03-17 14:23:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419271376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:23:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706361523] [2025-03-17 14:23:09,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:23:09,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:23:09,550 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-17 14:23:09,552 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-17 14:23:09,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:23:09,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:23:09,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:09,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:09,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:23:09,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:23:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:23:09,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:23:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:23:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706361523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:23:09,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:23:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-17 14:23:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144397031] [2025-03-17 14:23:09,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:23:09,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:23:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:23:09,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:23:09,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:23:10,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:23:10,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 161 transitions, 1534 flow. Second operand has 16 states, 16 states have (on average 51.375) internal successors, (822), 16 states have internal predecessors, (822), 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-17 14:23:10,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:23:10,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:23:10,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:23:16,099 INFO L124 PetriNetUnfolderBase]: 39138/70293 cut-off events. [2025-03-17 14:23:16,100 INFO L125 PetriNetUnfolderBase]: For 154453/159652 co-relation queries the response was YES. [2025-03-17 14:23:16,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193596 conditions, 70293 events. 39138/70293 cut-off events. For 154453/159652 co-relation queries the response was YES. Maximal size of possible extension queue 2855. Compared 710888 event pairs, 14247 based on Foata normal form. 1201/69339 useless extension candidates. Maximal degree in co-relation 129507. Up to 18385 conditions per place. [2025-03-17 14:23:16,656 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 305 selfloop transitions, 82 changer transitions 0/414 dead transitions. [2025-03-17 14:23:16,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 414 transitions, 3956 flow [2025-03-17 14:23:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 14:23:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-17 14:23:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1372 transitions. [2025-03-17 14:23:16,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6856571714142928 [2025-03-17 14:23:16,658 INFO L175 Difference]: Start difference. First operand has 162 places, 161 transitions, 1534 flow. Second operand 23 states and 1372 transitions. [2025-03-17 14:23:16,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 414 transitions, 3956 flow [2025-03-17 14:23:16,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 414 transitions, 3824 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-03-17 14:23:16,869 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 1965 flow [2025-03-17 14:23:16,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1965, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-03-17 14:23:16,869 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 102 predicate places. [2025-03-17 14:23:16,869 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 1965 flow [2025-03-17 14:23:16,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.375) internal successors, (822), 16 states have internal predecessors, (822), 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-17 14:23:16,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:23:16,870 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:23:16,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:23:17,070 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,SelfDestructingSolverStorable22 [2025-03-17 14:23:17,070 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:23:17,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:23:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash -977147223, now seen corresponding path program 1 times [2025-03-17 14:23:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:23:17,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294885775] [2025-03-17 14:23:17,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:23:17,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:23:17,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:23:17,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:17,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:23:17,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:23:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294885775] [2025-03-17 14:23:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294885775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:23:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182953341] [2025-03-17 14:23:17,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:23:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:23:17,131 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-17 14:23:17,275 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-17 14:23:17,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:23:17,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:23:17,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:17,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:17,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:23:17,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:23:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:23:17,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:23:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:23:17,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182953341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:23:17,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:23:17,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-17 14:23:17,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682964907] [2025-03-17 14:23:17,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:23:17,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:23:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:23:17,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:23:17,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:23:17,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-17 14:23:17,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 1965 flow. Second operand has 16 states, 16 states have (on average 51.5625) internal successors, (825), 16 states have internal predecessors, (825), 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-17 14:23:17,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:23:17,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-17 14:23:17,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:23:22,821 INFO L124 PetriNetUnfolderBase]: 30865/55238 cut-off events. [2025-03-17 14:23:22,821 INFO L125 PetriNetUnfolderBase]: For 149790/154702 co-relation queries the response was YES. [2025-03-17 14:23:23,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157314 conditions, 55238 events. 30865/55238 cut-off events. For 149790/154702 co-relation queries the response was YES. Maximal size of possible extension queue 2331. Compared 539932 event pairs, 12626 based on Foata normal form. 863/54534 useless extension candidates. Maximal degree in co-relation 103376. Up to 15961 conditions per place. [2025-03-17 14:23:23,269 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 309 selfloop transitions, 90 changer transitions 0/426 dead transitions. [2025-03-17 14:23:23,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 426 transitions, 4459 flow [2025-03-17 14:23:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 14:23:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 14:23:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1256 transitions. [2025-03-17 14:23:23,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6874657909140668 [2025-03-17 14:23:23,274 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 1965 flow. Second operand 21 states and 1256 transitions. [2025-03-17 14:23:23,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 426 transitions, 4459 flow [2025-03-17 14:23:23,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 426 transitions, 4415 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-17 14:23:23,438 INFO L231 Difference]: Finished difference. Result has 206 places, 196 transitions, 2257 flow [2025-03-17 14:23:23,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2257, PETRI_PLACES=206, PETRI_TRANSITIONS=196} [2025-03-17 14:23:23,438 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 122 predicate places. [2025-03-17 14:23:23,438 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 196 transitions, 2257 flow [2025-03-17 14:23:23,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.5625) internal successors, (825), 16 states have internal predecessors, (825), 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-17 14:23:23,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:23:23,439 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:23:23,445 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-17 14:23:23,639 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,SelfDestructingSolverStorable23 [2025-03-17 14:23:23,639 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:23:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:23:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -407285406, now seen corresponding path program 2 times [2025-03-17 14:23:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:23:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075474211] [2025-03-17 14:23:23,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:23:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:23:23,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 14:23:23,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:23:23,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:23:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:23:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:23:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075474211] [2025-03-17 14:23:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075474211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:23:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350122234] [2025-03-17 14:23:23,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:23:23,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:23:23,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:23:23,856 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-17 14:23:23,858 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-17 14:23:23,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 14:23:23,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:23:23,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:23:23,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:23,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 14:23:23,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:23:23,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:23:23,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:23:23,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:23:23,980 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:23:23,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 14:23:24,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:23:24,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:23:24,015 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:23:24,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:23:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:23:24,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:23:24,396 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 100 treesize of output 96 [2025-03-17 14:23:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:23:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350122234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:23:24,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:23:24,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2025-03-17 14:23:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918026281] [2025-03-17 14:23:24,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:23:24,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 14:23:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:23:24,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 14:23:24,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:23:28,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 87 [2025-03-17 14:23:28,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 196 transitions, 2257 flow. Second operand has 24 states, 24 states have (on average 36.125) internal successors, (867), 24 states have internal predecessors, (867), 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-17 14:23:28,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:23:28,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 87 [2025-03-17 14:23:28,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:23:39,109 INFO L124 PetriNetUnfolderBase]: 63585/100562 cut-off events. [2025-03-17 14:23:39,109 INFO L125 PetriNetUnfolderBase]: For 272225/279490 co-relation queries the response was YES. [2025-03-17 14:23:39,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296488 conditions, 100562 events. 63585/100562 cut-off events. For 272225/279490 co-relation queries the response was YES. Maximal size of possible extension queue 3464. Compared 900556 event pairs, 5325 based on Foata normal form. 964/100467 useless extension candidates. Maximal degree in co-relation 213594. Up to 22365 conditions per place. [2025-03-17 14:23:40,075 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 381 selfloop transitions, 79 changer transitions 0/480 dead transitions. [2025-03-17 14:23:40,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 480 transitions, 5019 flow [2025-03-17 14:23:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 14:23:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-17 14:23:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 944 transitions. [2025-03-17 14:23:40,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.542528735632184 [2025-03-17 14:23:40,077 INFO L175 Difference]: Start difference. First operand has 206 places, 196 transitions, 2257 flow. Second operand 20 states and 944 transitions. [2025-03-17 14:23:40,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 480 transitions, 5019 flow [2025-03-17 14:23:40,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 480 transitions, 4987 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-17 14:23:40,319 INFO L231 Difference]: Finished difference. Result has 223 places, 198 transitions, 2424 flow [2025-03-17 14:23:40,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2424, PETRI_PLACES=223, PETRI_TRANSITIONS=198} [2025-03-17 14:23:40,319 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 139 predicate places. [2025-03-17 14:23:40,319 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 198 transitions, 2424 flow [2025-03-17 14:23:40,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 36.125) internal successors, (867), 24 states have internal predecessors, (867), 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-17 14:23:40,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:23:40,319 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:23:40,325 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-17 14:23:40,520 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,SelfDestructingSolverStorable24 [2025-03-17 14:23:40,520 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-17 14:23:40,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:23:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash 259055013, now seen corresponding path program 1 times [2025-03-17 14:23:40,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:23:40,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59432052] [2025-03-17 14:23:40,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:40,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:23:40,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:23:40,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:23:40,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:40,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:23:40,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:23:40,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59432052] [2025-03-17 14:23:40,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59432052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:23:40,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862633834] [2025-03-17 14:23:40,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:23:40,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:23:40,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:23:40,680 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:23:40,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:23:40,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:23:40,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:23:40,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:23:40,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:23:40,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:23:40,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:23:40,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:23:40,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:23:40,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:23:40,815 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:23:40,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:23:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:23:40,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:23:40,947 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 52 treesize of output 48 [2025-03-17 14:23:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:23:41,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862633834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:23:41,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:23:41,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-17 14:23:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261285653] [2025-03-17 14:23:41,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:23:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:23:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:23:41,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:23:41,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:23:42,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 87 [2025-03-17 14:23:42,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 198 transitions, 2424 flow. Second operand has 20 states, 20 states have (on average 45.95) internal successors, (919), 20 states have internal predecessors, (919), 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-17 14:23:42,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:23:42,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 87 [2025-03-17 14:23:42,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand