./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-5.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/unroll-5.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 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:33:29,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:33:29,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:33:29,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:33:29,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:33:29,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:33:29,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:33:29,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:33:29,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:33:29,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:33:29,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:33:29,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:33:29,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:33:29,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:33:29,958 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:33:29,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:33:29,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:33:29,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:33:29,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:33:29,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:33:29,958 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:33:29,958 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:33:29,958 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:33:29,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:33:29,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:33:29,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:33:29,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:33:29,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:33:29,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:33:29,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:33:29,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:33:29,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:33:29,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:33:29,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:33:29,960 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 -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2025-03-17 14:33:30,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:33:30,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:33:30,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:33:30,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:33:30,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:33:30,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-03-17 14:33:31,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8c13ab1/b1a52691195f4d3f93bd9acbb310a2f4/FLAGe6c3b3d69 [2025-03-17 14:33:31,618 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:33:31,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-03-17 14:33:31,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8c13ab1/b1a52691195f4d3f93bd9acbb310a2f4/FLAGe6c3b3d69 [2025-03-17 14:33:31,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8c13ab1/b1a52691195f4d3f93bd9acbb310a2f4 [2025-03-17 14:33:31,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:33:31,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:33:31,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:33:31,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:33:31,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:33:31,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:33:31" (1/1) ... [2025-03-17 14:33:31,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f8cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:31, skipping insertion in model container [2025-03-17 14:33:31,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:33:31" (1/1) ... [2025-03-17 14:33:31,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:33:32,099 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:33:32,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:33:32,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:33:32,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:33:32,135 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:33:32,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32 WrapperNode [2025-03-17 14:33:32,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:33:32,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:33:32,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:33:32,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:33:32,141 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:33:32" (1/1) ... [2025-03-17 14:33:32,151 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:33:32" (1/1) ... [2025-03-17 14:33:32,166 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 150 [2025-03-17 14:33:32,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:33:32,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:33:32,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:33:32,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:33:32,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,185 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 14:33:32,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:33:32,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:33:32,200 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:33:32,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:33:32,201 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (1/1) ... [2025-03-17 14:33:32,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:33:32,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:32,223 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:33:32,227 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:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:33:32,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:33:32,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:33:32,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:33:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:33:32,244 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:33:32,313 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:33:32,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:33:32,551 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:33:32,551 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:33:32,736 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:33:32,737 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:33:32,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:33:32 BoogieIcfgContainer [2025-03-17 14:33:32,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:33:32,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:33:32,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:33:32,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:33:32,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:33:31" (1/3) ... [2025-03-17 14:33:32,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524d4421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:33:32, skipping insertion in model container [2025-03-17 14:33:32,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:33:32" (2/3) ... [2025-03-17 14:33:32,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524d4421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:33:32, skipping insertion in model container [2025-03-17 14:33:32,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:33:32" (3/3) ... [2025-03-17 14:33:32,746 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2025-03-17 14:33:32,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:33:32,756 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-5.wvr.c that has 3 procedures, 41 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-17 14:33:32,756 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:33:32,802 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:33:32,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 100 flow [2025-03-17 14:33:32,856 INFO L124 PetriNetUnfolderBase]: 3/41 cut-off events. [2025-03-17 14:33:32,858 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:33:32,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 3/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-17 14:33:32,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 100 flow [2025-03-17 14:33:32,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 40 transitions, 92 flow [2025-03-17 14:33:32,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:33:32,884 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;@2f582e6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:33:32,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-17 14:33:32,889 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:33:32,889 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:33:32,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:33:32,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:32,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:33:32,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:32,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 447064, now seen corresponding path program 1 times [2025-03-17 14:33:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947834098] [2025-03-17 14:33:32,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:32,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:33:32,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:33:32,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:32,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:33,096 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:33:33,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:33,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947834098] [2025-03-17 14:33:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947834098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:33:33,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:33:33,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978299170] [2025-03-17 14:33:33,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:33,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:33:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:33,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:33:33,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:33:33,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-17 14:33:33,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:33:33,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:33,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-17 14:33:33,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:33,237 INFO L124 PetriNetUnfolderBase]: 114/291 cut-off events. [2025-03-17 14:33:33,237 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-17 14:33:33,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 291 events. 114/291 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1355 event pairs, 86 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 444. Up to 197 conditions per place. [2025-03-17 14:33:33,240 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 21 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-17 14:33:33,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 132 flow [2025-03-17 14:33:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:33:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:33:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-17 14:33:33,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2025-03-17 14:33:33,249 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 92 flow. Second operand 3 states and 76 transitions. [2025-03-17 14:33:33,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 132 flow [2025-03-17 14:33:33,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:33:33,253 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 82 flow [2025-03-17 14:33:33,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-17 14:33:33,257 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-03-17 14:33:33,257 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 82 flow [2025-03-17 14:33:33,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:33:33,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:33,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:33:33,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:33:33,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:33,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 447065, now seen corresponding path program 1 times [2025-03-17 14:33:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:33,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928622766] [2025-03-17 14:33:33,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:33,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:33:33,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:33:33,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:33,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:33,512 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:33:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928622766] [2025-03-17 14:33:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928622766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:33:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:33:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200213489] [2025-03-17 14:33:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:33:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:33,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:33:33,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:33:33,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-17 14:33:33,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:33:33,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:33,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-17 14:33:33,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:33,642 INFO L124 PetriNetUnfolderBase]: 114/293 cut-off events. [2025-03-17 14:33:33,642 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:33:33,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 293 events. 114/293 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1355 event pairs, 86 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 486. Up to 201 conditions per place. [2025-03-17 14:33:33,645 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-17 14:33:33,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 138 flow [2025-03-17 14:33:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:33:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:33:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-17 14:33:33,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2025-03-17 14:33:33,647 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 82 flow. Second operand 3 states and 79 transitions. [2025-03-17 14:33:33,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 138 flow [2025-03-17 14:33:33,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:33:33,649 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 92 flow [2025-03-17 14:33:33,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-17 14:33:33,651 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-03-17 14:33:33,651 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 92 flow [2025-03-17 14:33:33,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:33:33,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:33,651 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:33:33,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:33:33,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:33,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 429644080, now seen corresponding path program 1 times [2025-03-17 14:33:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:33,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330688361] [2025-03-17 14:33:33,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:33,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:33:33,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:33:33,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:33,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:33,908 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:33:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330688361] [2025-03-17 14:33:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330688361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352628338] [2025-03-17 14:33:33,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:33,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:33,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:33,911 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:33:33,912 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:33:33,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:33:33,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:33:33,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:33,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:33,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:33:33,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:34,008 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:33:34,171 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:33:34,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:34,246 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:33:34,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352628338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:34,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:34,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:33:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065841430] [2025-03-17 14:33:34,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:33:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:34,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:33:34,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:33:34,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-17 14:33:34,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 92 flow. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 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:33:34,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:34,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-17 14:33:34,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:34,622 INFO L124 PetriNetUnfolderBase]: 115/295 cut-off events. [2025-03-17 14:33:34,623 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:33:34,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 295 events. 115/295 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1363 event pairs, 86 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 502. Up to 198 conditions per place. [2025-03-17 14:33:34,624 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 20 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2025-03-17 14:33:34,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 156 flow [2025-03-17 14:33:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:33:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:33:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-03-17 14:33:34,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4950166112956811 [2025-03-17 14:33:34,626 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 92 flow. Second operand 7 states and 149 transitions. [2025-03-17 14:33:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 156 flow [2025-03-17 14:33:34,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:33:34,627 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 116 flow [2025-03-17 14:33:34,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2025-03-17 14:33:34,628 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-03-17 14:33:34,628 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 116 flow [2025-03-17 14:33:34,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 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:33:34,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:34,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:34,634 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:33:34,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:34,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash 527279960, now seen corresponding path program 1 times [2025-03-17 14:33:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532849883] [2025-03-17 14:33:34,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:34,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:33:34,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:33:34,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:34,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:34,879 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:33:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532849883] [2025-03-17 14:33:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532849883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:34,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:33:34,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:33:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532866870] [2025-03-17 14:33:34,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:34,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:33:34,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:34,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:33:34,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:33:34,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-17 14:33:34,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:33:34,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:34,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-17 14:33:34,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:34,957 INFO L124 PetriNetUnfolderBase]: 115/250 cut-off events. [2025-03-17 14:33:34,957 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:33:34,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 250 events. 115/250 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 912 event pairs, 86 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 441. Up to 197 conditions per place. [2025-03-17 14:33:34,959 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 25 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-03-17 14:33:34,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 160 flow [2025-03-17 14:33:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:33:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:33:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-17 14:33:34,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42441860465116277 [2025-03-17 14:33:34,960 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 116 flow. Second operand 4 states and 73 transitions. [2025-03-17 14:33:34,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 160 flow [2025-03-17 14:33:34,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 145 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-17 14:33:34,961 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 95 flow [2025-03-17 14:33:34,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-03-17 14:33:34,962 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2025-03-17 14:33:34,962 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 95 flow [2025-03-17 14:33:34,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:33:34,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:34,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:34,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:33:34,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:34,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 527279961, now seen corresponding path program 1 times [2025-03-17 14:33:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558157259] [2025-03-17 14:33:34,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:34,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:33:34,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:33:34,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:34,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:35,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:35,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558157259] [2025-03-17 14:33:35,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558157259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:35,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648904873] [2025-03-17 14:33:35,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:35,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:35,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:35,152 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:33:35,154 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:33:35,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:33:35,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:33:35,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:35,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:35,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:33:35,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:35,203 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:33:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:35,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:35,335 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:33:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648904873] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:35,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:33:35,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 9 [2025-03-17 14:33:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250507668] [2025-03-17 14:33:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:35,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:33:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:35,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:33:35,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:33:35,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-17 14:33:35,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:33:35,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:35,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-17 14:33:35,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:35,506 INFO L124 PetriNetUnfolderBase]: 227/443 cut-off events. [2025-03-17 14:33:35,507 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:33:35,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 443 events. 227/443 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1913 event pairs, 86 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 832. Up to 213 conditions per place. [2025-03-17 14:33:35,511 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 42 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-03-17 14:33:35,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 224 flow [2025-03-17 14:33:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:33:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:33:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-17 14:33:35,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-03-17 14:33:35,514 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 95 flow. Second operand 4 states and 110 transitions. [2025-03-17 14:33:35,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 224 flow [2025-03-17 14:33:35,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:33:35,516 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 108 flow [2025-03-17 14:33:35,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-03-17 14:33:35,517 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-03-17 14:33:35,518 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 108 flow [2025-03-17 14:33:35,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:33:35,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:35,519 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:35,525 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:33:35,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:35,719 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:35,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:35,720 INFO L85 PathProgramCache]: Analyzing trace with hash -90083108, now seen corresponding path program 1 times [2025-03-17 14:33:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:35,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512142520] [2025-03-17 14:33:35,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:35,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:33:35,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:33:35,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:35,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512142520] [2025-03-17 14:33:35,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512142520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464714211] [2025-03-17 14:33:35,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:35,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:35,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:35,863 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:33:35,864 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:33:35,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:33:35,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:33:35,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:35,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:35,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:33:35,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:36,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:36,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-17 14:33:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:36,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464714211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:36,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:36,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-17 14:33:36,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640601586] [2025-03-17 14:33:36,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:36,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 14:33:36,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:36,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 14:33:36,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:33:36,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-17 14:33:36,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 108 flow. Second operand has 17 states, 17 states have (on average 18.764705882352942) internal successors, (319), 17 states have internal predecessors, (319), 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:33:36,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:36,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-17 14:33:36,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:36,968 INFO L124 PetriNetUnfolderBase]: 464/979 cut-off events. [2025-03-17 14:33:36,968 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-17 14:33:36,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 979 events. 464/979 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5396 event pairs, 243 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 982. Up to 393 conditions per place. [2025-03-17 14:33:36,973 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 69 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2025-03-17 14:33:36,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 386 flow [2025-03-17 14:33:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:33:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:33:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2025-03-17 14:33:36,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-17 14:33:36,975 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 108 flow. Second operand 8 states and 215 transitions. [2025-03-17 14:33:36,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 386 flow [2025-03-17 14:33:36,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 86 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:33:36,977 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 162 flow [2025-03-17 14:33:36,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=162, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-17 14:33:36,978 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-03-17 14:33:36,978 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 162 flow [2025-03-17 14:33:36,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.764705882352942) internal successors, (319), 17 states have internal predecessors, (319), 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:33:36,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:36,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:36,986 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:33:37,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:37,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:37,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash -125414081, now seen corresponding path program 1 times [2025-03-17 14:33:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:37,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527320062] [2025-03-17 14:33:37,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:37,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:33:37,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:33:37,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:37,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:37,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527320062] [2025-03-17 14:33:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527320062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628289003] [2025-03-17 14:33:37,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:37,317 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:33:37,319 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:33:37,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:33:37,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:33:37,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:37,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:37,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:33:37,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:37,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:37,482 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 29 treesize of output 25 [2025-03-17 14:33:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:37,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628289003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:37,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:37,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:33:37,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902734651] [2025-03-17 14:33:37,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:37,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:33:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:37,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:33:37,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:33:37,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-17 14:33:37,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 162 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 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:33:37,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:37,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-17 14:33:37,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:37,804 INFO L124 PetriNetUnfolderBase]: 767/1349 cut-off events. [2025-03-17 14:33:37,804 INFO L125 PetriNetUnfolderBase]: For 831/903 co-relation queries the response was YES. [2025-03-17 14:33:37,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1349 events. 767/1349 cut-off events. For 831/903 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6359 event pairs, 162 based on Foata normal form. 32/1189 useless extension candidates. Maximal degree in co-relation 2065. Up to 977 conditions per place. [2025-03-17 14:33:37,810 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 47 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2025-03-17 14:33:37,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 320 flow [2025-03-17 14:33:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:33:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:33:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-17 14:33:37,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49767441860465117 [2025-03-17 14:33:37,812 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 162 flow. Second operand 5 states and 107 transitions. [2025-03-17 14:33:37,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 320 flow [2025-03-17 14:33:37,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 313 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:33:37,817 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 179 flow [2025-03-17 14:33:37,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-03-17 14:33:37,818 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-03-17 14:33:37,818 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 179 flow [2025-03-17 14:33:37,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 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:33:37,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:37,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:37,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:33:38,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:38,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:38,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash 407131275, now seen corresponding path program 1 times [2025-03-17 14:33:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:38,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598714616] [2025-03-17 14:33:38,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:38,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:33:38,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:33:38,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:38,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598714616] [2025-03-17 14:33:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598714616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870437431] [2025-03-17 14:33:38,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:38,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:38,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:38,145 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:33:38,148 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:33:38,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:33:38,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:33:38,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:38,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:38,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:33:38,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:38,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:38,314 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 29 treesize of output 25 [2025-03-17 14:33:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870437431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:38,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:38,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 14:33:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106952292] [2025-03-17 14:33:38,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:38,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:33:38,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:38,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:33:38,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:33:38,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-17 14:33:38,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 179 flow. Second operand has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 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:33:38,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:38,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-17 14:33:38,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:38,822 INFO L124 PetriNetUnfolderBase]: 859/1498 cut-off events. [2025-03-17 14:33:38,822 INFO L125 PetriNetUnfolderBase]: For 1027/1114 co-relation queries the response was YES. [2025-03-17 14:33:38,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 1498 events. 859/1498 cut-off events. For 1027/1114 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6996 event pairs, 428 based on Foata normal form. 0/1306 useless extension candidates. Maximal degree in co-relation 2230. Up to 1153 conditions per place. [2025-03-17 14:33:38,834 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 64 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2025-03-17 14:33:38,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 423 flow [2025-03-17 14:33:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:33:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:33:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-03-17 14:33:38,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-03-17 14:33:38,836 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 179 flow. Second operand 7 states and 161 transitions. [2025-03-17 14:33:38,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 423 flow [2025-03-17 14:33:38,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 412 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 14:33:38,840 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 202 flow [2025-03-17 14:33:38,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-03-17 14:33:38,841 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2025-03-17 14:33:38,842 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 202 flow [2025-03-17 14:33:38,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 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:33:38,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:38,842 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:38,849 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:33:39,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:39,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:39,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1687575077, now seen corresponding path program 2 times [2025-03-17 14:33:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:39,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740166879] [2025-03-17 14:33:39,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:39,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:39,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 14:33:39,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-17 14:33:39,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:33:39,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:33:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740166879] [2025-03-17 14:33:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740166879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410386891] [2025-03-17 14:33:39,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:39,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:39,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:39,156 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:33:39,158 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:33:39,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 14:33:39,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-17 14:33:39,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:33:39,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:39,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:33:39,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:39,214 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:33:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:33:39,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:33:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410386891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:39,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:33:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577604768] [2025-03-17 14:33:39,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:39,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:33:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:39,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:33:39,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:33:39,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-17 14:33:39,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 202 flow. Second operand has 11 states, 11 states have (on average 19.727272727272727) internal successors, (217), 11 states have internal predecessors, (217), 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:33:39,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:39,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-17 14:33:39,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:39,832 INFO L124 PetriNetUnfolderBase]: 629/1225 cut-off events. [2025-03-17 14:33:39,833 INFO L125 PetriNetUnfolderBase]: For 514/514 co-relation queries the response was YES. [2025-03-17 14:33:39,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3110 conditions, 1225 events. 629/1225 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6429 event pairs, 362 based on Foata normal form. 0/1161 useless extension candidates. Maximal degree in co-relation 1872. Up to 814 conditions per place. [2025-03-17 14:33:39,839 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 40 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2025-03-17 14:33:39,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 345 flow [2025-03-17 14:33:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:33:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:33:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-03-17 14:33:39,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-03-17 14:33:39,842 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 202 flow. Second operand 5 states and 120 transitions. [2025-03-17 14:33:39,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 345 flow [2025-03-17 14:33:39,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 328 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:33:39,846 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 201 flow [2025-03-17 14:33:39,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-03-17 14:33:39,847 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2025-03-17 14:33:39,847 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 201 flow [2025-03-17 14:33:39,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.727272727272727) internal successors, (217), 11 states have internal predecessors, (217), 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:33:39,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:39,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:39,853 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:33:40,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:40,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:40,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash -320039838, now seen corresponding path program 2 times [2025-03-17 14:33:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:40,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271464263] [2025-03-17 14:33:40,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:40,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:40,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 14:33:40,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-17 14:33:40,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:33:40,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:33:40,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271464263] [2025-03-17 14:33:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271464263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:40,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:33:40,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:33:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160739203] [2025-03-17 14:33:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:40,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:33:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:40,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:33:40,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:33:40,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-17 14:33:40,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:40,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:40,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-17 14:33:40,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:40,400 INFO L124 PetriNetUnfolderBase]: 675/1183 cut-off events. [2025-03-17 14:33:40,400 INFO L125 PetriNetUnfolderBase]: For 1458/1458 co-relation queries the response was YES. [2025-03-17 14:33:40,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 1183 events. 675/1183 cut-off events. For 1458/1458 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5222 event pairs, 322 based on Foata normal form. 96/1183 useless extension candidates. Maximal degree in co-relation 1915. Up to 684 conditions per place. [2025-03-17 14:33:40,405 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 39 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2025-03-17 14:33:40,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 338 flow [2025-03-17 14:33:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:33:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:33:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-03-17 14:33:40,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4604651162790698 [2025-03-17 14:33:40,406 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 201 flow. Second operand 5 states and 99 transitions. [2025-03-17 14:33:40,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 338 flow [2025-03-17 14:33:40,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 306 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:33:40,407 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 181 flow [2025-03-17 14:33:40,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-17 14:33:40,408 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-03-17 14:33:40,408 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 181 flow [2025-03-17 14:33:40,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:40,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:40,408 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:33:40,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:33:40,408 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:40,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash -535255147, now seen corresponding path program 1 times [2025-03-17 14:33:40,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:40,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028485753] [2025-03-17 14:33:40,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:40,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:33:40,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:33:40,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:40,434 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:33:40,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:40,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028485753] [2025-03-17 14:33:40,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028485753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:40,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:33:40,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:33:40,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347480586] [2025-03-17 14:33:40,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:40,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:33:40,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:40,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:33:40,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:33:40,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-17 14:33:40,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:40,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:40,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-17 14:33:40,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:40,532 INFO L124 PetriNetUnfolderBase]: 629/1133 cut-off events. [2025-03-17 14:33:40,533 INFO L125 PetriNetUnfolderBase]: For 932/932 co-relation queries the response was YES. [2025-03-17 14:33:40,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 1133 events. 629/1133 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5153 event pairs, 174 based on Foata normal form. 2/1071 useless extension candidates. Maximal degree in co-relation 1798. Up to 913 conditions per place. [2025-03-17 14:33:40,538 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 43 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2025-03-17 14:33:40,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 320 flow [2025-03-17 14:33:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:33:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:33:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-17 14:33:40,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2025-03-17 14:33:40,539 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 181 flow. Second operand 3 states and 91 transitions. [2025-03-17 14:33:40,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 320 flow [2025-03-17 14:33:40,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 302 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:33:40,540 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 198 flow [2025-03-17 14:33:40,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2025-03-17 14:33:40,541 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-03-17 14:33:40,541 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 198 flow [2025-03-17 14:33:40,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:40,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:40,541 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:40,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:33:40,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:40,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash -762440824, now seen corresponding path program 1 times [2025-03-17 14:33:40,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:40,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592070512] [2025-03-17 14:33:40,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:40,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:40,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:33:40,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:33:40,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:40,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592070512] [2025-03-17 14:33:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592070512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233929397] [2025-03-17 14:33:40,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:40,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:40,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:40,710 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:33:40,711 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:33:40,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:33:40,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:33:40,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:40,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:40,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:33:40,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:40,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:40,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-17 14:33:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:33:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233929397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:41,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-17 14:33:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528543898] [2025-03-17 14:33:41,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:41,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 14:33:41,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:41,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 14:33:41,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:33:41,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-17 14:33:41,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 198 flow. Second operand has 17 states, 17 states have (on average 15.823529411764707) internal successors, (269), 17 states have internal predecessors, (269), 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:33:41,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:41,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-17 14:33:41,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:41,565 INFO L124 PetriNetUnfolderBase]: 652/1140 cut-off events. [2025-03-17 14:33:41,566 INFO L125 PetriNetUnfolderBase]: For 983/983 co-relation queries the response was YES. [2025-03-17 14:33:41,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 1140 events. 652/1140 cut-off events. For 983/983 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4962 event pairs, 320 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 1875. Up to 508 conditions per place. [2025-03-17 14:33:41,571 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 69 selfloop transitions, 11 changer transitions 1/82 dead transitions. [2025-03-17 14:33:41,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 489 flow [2025-03-17 14:33:41,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:33:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:33:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2025-03-17 14:33:41,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2025-03-17 14:33:41,572 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 198 flow. Second operand 8 states and 176 transitions. [2025-03-17 14:33:41,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 489 flow [2025-03-17 14:33:41,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 480 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 14:33:41,575 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 233 flow [2025-03-17 14:33:41,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-03-17 14:33:41,577 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2025-03-17 14:33:41,577 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 233 flow [2025-03-17 14:33:41,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.823529411764707) internal successors, (269), 17 states have internal predecessors, (269), 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:33:41,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:41,578 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:41,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:33:41,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:41,778 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:41,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1760091631, now seen corresponding path program 2 times [2025-03-17 14:33:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347640761] [2025-03-17 14:33:41,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:41,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:41,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 18 statements. [2025-03-17 14:33:41,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:33:41,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:33:41,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:41,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347640761] [2025-03-17 14:33:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347640761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:41,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225430540] [2025-03-17 14:33:41,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:41,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:41,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:41,879 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:33:41,880 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:33:41,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:41,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 18 statements. [2025-03-17 14:33:41,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:33:41,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:41,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:33:41,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:41,953 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:33:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:33:42,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:33:42,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225430540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:42,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:42,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-17 14:33:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714990774] [2025-03-17 14:33:42,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:42,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:33:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:42,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:33:42,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:33:42,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-17 14:33:42,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 233 flow. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 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:33:42,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:42,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-17 14:33:42,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:42,558 INFO L124 PetriNetUnfolderBase]: 629/1101 cut-off events. [2025-03-17 14:33:42,558 INFO L125 PetriNetUnfolderBase]: For 1309/1309 co-relation queries the response was YES. [2025-03-17 14:33:42,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 1101 events. 629/1101 cut-off events. For 1309/1309 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4760 event pairs, 196 based on Foata normal form. 16/1117 useless extension candidates. Maximal degree in co-relation 1842. Up to 640 conditions per place. [2025-03-17 14:33:42,563 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 44 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2025-03-17 14:33:42,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 403 flow [2025-03-17 14:33:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:33:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:33:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-17 14:33:42,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2025-03-17 14:33:42,565 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 233 flow. Second operand 5 states and 95 transitions. [2025-03-17 14:33:42,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 403 flow [2025-03-17 14:33:42,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 386 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-17 14:33:42,567 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 227 flow [2025-03-17 14:33:42,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-03-17 14:33:42,568 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2025-03-17 14:33:42,568 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 227 flow [2025-03-17 14:33:42,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 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:33:42,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:42,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:42,575 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:33:42,772 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,SelfDestructingSolverStorable12 [2025-03-17 14:33:42,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:42,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash 514357370, now seen corresponding path program 1 times [2025-03-17 14:33:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089259931] [2025-03-17 14:33:42,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:42,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:33:42,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:33:42,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:42,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:42,862 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:33:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089259931] [2025-03-17 14:33:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089259931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:42,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:33:42,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:33:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323638815] [2025-03-17 14:33:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:42,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:33:42,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:42,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:33:42,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:33:42,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-17 14:33:42,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:42,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:42,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-17 14:33:42,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:43,035 INFO L124 PetriNetUnfolderBase]: 641/1149 cut-off events. [2025-03-17 14:33:43,035 INFO L125 PetriNetUnfolderBase]: For 1437/1437 co-relation queries the response was YES. [2025-03-17 14:33:43,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3428 conditions, 1149 events. 641/1149 cut-off events. For 1437/1437 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5324 event pairs, 94 based on Foata normal form. 58/1207 useless extension candidates. Maximal degree in co-relation 2102. Up to 594 conditions per place. [2025-03-17 14:33:43,040 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 75 selfloop transitions, 16 changer transitions 1/93 dead transitions. [2025-03-17 14:33:43,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 651 flow [2025-03-17 14:33:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:33:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:33:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-03-17 14:33:43,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-03-17 14:33:43,041 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 227 flow. Second operand 7 states and 196 transitions. [2025-03-17 14:33:43,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 651 flow [2025-03-17 14:33:43,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 617 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:33:43,046 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 365 flow [2025-03-17 14:33:43,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=365, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-03-17 14:33:43,047 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2025-03-17 14:33:43,047 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 365 flow [2025-03-17 14:33:43,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:43,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:43,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:43,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:33:43,047 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1920955204, now seen corresponding path program 2 times [2025-03-17 14:33:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498675139] [2025-03-17 14:33:43,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:43,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:43,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:33:43,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:33:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498675139] [2025-03-17 14:33:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498675139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468187491] [2025-03-17 14:33:43,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:43,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:43,233 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:33:43,235 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:33:43,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:43,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:33:43,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:33:43,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:43,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:33:43,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:43,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:33:43,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468187491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:43,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:33:43,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2025-03-17 14:33:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646076560] [2025-03-17 14:33:43,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:43,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:33:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:43,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:33:43,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:33:43,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-17 14:33:43,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:33:43,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:43,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-17 14:33:43,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:43,527 INFO L124 PetriNetUnfolderBase]: 633/1153 cut-off events. [2025-03-17 14:33:43,527 INFO L125 PetriNetUnfolderBase]: For 2841/2841 co-relation queries the response was YES. [2025-03-17 14:33:43,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1153 events. 633/1153 cut-off events. For 2841/2841 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5359 event pairs, 270 based on Foata normal form. 12/1165 useless extension candidates. Maximal degree in co-relation 2651. Up to 838 conditions per place. [2025-03-17 14:33:43,532 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 64 selfloop transitions, 10 changer transitions 5/80 dead transitions. [2025-03-17 14:33:43,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 700 flow [2025-03-17 14:33:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:33:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:33:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-17 14:33:43,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-17 14:33:43,533 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 365 flow. Second operand 5 states and 135 transitions. [2025-03-17 14:33:43,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 700 flow [2025-03-17 14:33:43,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 678 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 14:33:43,538 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 398 flow [2025-03-17 14:33:43,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2025-03-17 14:33:43,539 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2025-03-17 14:33:43,539 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 398 flow [2025-03-17 14:33:43,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:33:43,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:43,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:43,546 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:33:43,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:33:43,744 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1992338534, now seen corresponding path program 3 times [2025-03-17 14:33:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722650799] [2025-03-17 14:33:43,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:33:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:43,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:43,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:33:43,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:33:43,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:43,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722650799] [2025-03-17 14:33:43,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722650799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064165774] [2025-03-17 14:33:43,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:33:43,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:43,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:43,916 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:33:43,918 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:33:43,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:43,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:33:43,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:33:43,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:43,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:33:43,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:44,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:44,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064165774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:44,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:44,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 12 [2025-03-17 14:33:44,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595702232] [2025-03-17 14:33:44,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:44,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:33:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:44,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:33:44,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:33:44,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-17 14:33:44,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 398 flow. Second operand has 12 states, 12 states have (on average 21.25) internal successors, (255), 12 states have internal predecessors, (255), 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:33:44,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:44,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-17 14:33:44,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:44,369 INFO L124 PetriNetUnfolderBase]: 849/1531 cut-off events. [2025-03-17 14:33:44,369 INFO L125 PetriNetUnfolderBase]: For 4772/4772 co-relation queries the response was YES. [2025-03-17 14:33:44,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6047 conditions, 1531 events. 849/1531 cut-off events. For 4772/4772 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7783 event pairs, 202 based on Foata normal form. 18/1549 useless extension candidates. Maximal degree in co-relation 3738. Up to 582 conditions per place. [2025-03-17 14:33:44,382 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 78 selfloop transitions, 62 changer transitions 3/144 dead transitions. [2025-03-17 14:33:44,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 144 transitions, 1306 flow [2025-03-17 14:33:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:33:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:33:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 291 transitions. [2025-03-17 14:33:44,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6152219873150105 [2025-03-17 14:33:44,388 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 398 flow. Second operand 11 states and 291 transitions. [2025-03-17 14:33:44,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 144 transitions, 1306 flow [2025-03-17 14:33:44,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 144 transitions, 1260 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-17 14:33:44,398 INFO L231 Difference]: Finished difference. Result has 81 places, 93 transitions, 978 flow [2025-03-17 14:33:44,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=978, PETRI_PLACES=81, PETRI_TRANSITIONS=93} [2025-03-17 14:33:44,398 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2025-03-17 14:33:44,399 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 93 transitions, 978 flow [2025-03-17 14:33:44,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.25) internal successors, (255), 12 states have internal predecessors, (255), 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:33:44,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:44,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:44,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:33:44,599 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,SelfDestructingSolverStorable15 [2025-03-17 14:33:44,600 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:44,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1021439040, now seen corresponding path program 4 times [2025-03-17 14:33:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:44,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254644260] [2025-03-17 14:33:44,600 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:33:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:44,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:44,611 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:33:44,611 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:33:44,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:44,664 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:33:44,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254644260] [2025-03-17 14:33:44,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254644260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:44,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:33:44,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:33:44,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613303700] [2025-03-17 14:33:44,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:44,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:33:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:44,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:33:44,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:33:44,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-17 14:33:44,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 93 transitions, 978 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:33:44,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:44,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-17 14:33:44,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:44,865 INFO L124 PetriNetUnfolderBase]: 849/1531 cut-off events. [2025-03-17 14:33:44,865 INFO L125 PetriNetUnfolderBase]: For 7963/7963 co-relation queries the response was YES. [2025-03-17 14:33:44,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 1531 events. 849/1531 cut-off events. For 7963/7963 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7741 event pairs, 298 based on Foata normal form. 4/1535 useless extension candidates. Maximal degree in co-relation 6093. Up to 988 conditions per place. [2025-03-17 14:33:44,875 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 87 selfloop transitions, 29 changer transitions 2/119 dead transitions. [2025-03-17 14:33:44,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 1438 flow [2025-03-17 14:33:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:33:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:33:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-17 14:33:44,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6465116279069767 [2025-03-17 14:33:44,877 INFO L175 Difference]: Start difference. First operand has 81 places, 93 transitions, 978 flow. Second operand 5 states and 139 transitions. [2025-03-17 14:33:44,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 1438 flow [2025-03-17 14:33:44,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 119 transitions, 1400 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-03-17 14:33:44,892 INFO L231 Difference]: Finished difference. Result has 86 places, 99 transitions, 1118 flow [2025-03-17 14:33:44,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1118, PETRI_PLACES=86, PETRI_TRANSITIONS=99} [2025-03-17 14:33:44,893 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2025-03-17 14:33:44,893 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 99 transitions, 1118 flow [2025-03-17 14:33:44,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:33:44,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:44,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:44,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:33:44,894 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -696310020, now seen corresponding path program 5 times [2025-03-17 14:33:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76389602] [2025-03-17 14:33:44,894 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:33:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:44,899 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:44,904 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:33:44,904 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:33:44,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:44,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76389602] [2025-03-17 14:33:44,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76389602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:44,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863229828] [2025-03-17 14:33:44,966 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:33:44,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:44,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:44,968 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:33:44,970 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:33:45,006 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:33:45,020 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:33:45,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:33:45,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:45,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:33:45,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:45,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863229828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:45,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:45,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-17 14:33:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564917024] [2025-03-17 14:33:45,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:45,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:33:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:45,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:33:45,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:33:45,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-17 14:33:45,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 99 transitions, 1118 flow. Second operand has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 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:33:45,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:45,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-17 14:33:45,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:45,295 INFO L124 PetriNetUnfolderBase]: 891/1597 cut-off events. [2025-03-17 14:33:45,295 INFO L125 PetriNetUnfolderBase]: For 9823/9823 co-relation queries the response was YES. [2025-03-17 14:33:45,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8067 conditions, 1597 events. 891/1597 cut-off events. For 9823/9823 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8096 event pairs, 268 based on Foata normal form. 28/1625 useless extension candidates. Maximal degree in co-relation 6838. Up to 930 conditions per place. [2025-03-17 14:33:45,303 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 91 selfloop transitions, 50 changer transitions 4/146 dead transitions. [2025-03-17 14:33:45,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 146 transitions, 1774 flow [2025-03-17 14:33:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:33:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:33:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2025-03-17 14:33:45,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020671834625323 [2025-03-17 14:33:45,304 INFO L175 Difference]: Start difference. First operand has 86 places, 99 transitions, 1118 flow. Second operand 9 states and 233 transitions. [2025-03-17 14:33:45,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 146 transitions, 1774 flow [2025-03-17 14:33:45,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 146 transitions, 1734 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-17 14:33:45,323 INFO L231 Difference]: Finished difference. Result has 97 places, 108 transitions, 1354 flow [2025-03-17 14:33:45,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1354, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2025-03-17 14:33:45,324 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2025-03-17 14:33:45,324 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 1354 flow [2025-03-17 14:33:45,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 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:33:45,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:45,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:45,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:33:45,524 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,SelfDestructingSolverStorable17 [2025-03-17 14:33:45,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:45,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2097882214, now seen corresponding path program 1 times [2025-03-17 14:33:45,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320445416] [2025-03-17 14:33:45,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:45,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:33:45,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:33:45,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:45,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:45,600 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:33:45,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:45,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320445416] [2025-03-17 14:33:45,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320445416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:33:45,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:33:45,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:33:45,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995582250] [2025-03-17 14:33:45,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:33:45,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:33:45,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:45,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:33:45,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:33:45,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-17 14:33:45,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 1354 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:33:45,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:45,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-17 14:33:45,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:45,767 INFO L124 PetriNetUnfolderBase]: 807/1413 cut-off events. [2025-03-17 14:33:45,768 INFO L125 PetriNetUnfolderBase]: For 11599/11599 co-relation queries the response was YES. [2025-03-17 14:33:45,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7876 conditions, 1413 events. 807/1413 cut-off events. For 11599/11599 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6725 event pairs, 300 based on Foata normal form. 18/1431 useless extension candidates. Maximal degree in co-relation 6900. Up to 1044 conditions per place. [2025-03-17 14:33:45,775 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 97 selfloop transitions, 21 changer transitions 8/127 dead transitions. [2025-03-17 14:33:45,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 127 transitions, 1707 flow [2025-03-17 14:33:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:33:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:33:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-17 14:33:45,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6325581395348837 [2025-03-17 14:33:45,776 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 1354 flow. Second operand 5 states and 136 transitions. [2025-03-17 14:33:45,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 127 transitions, 1707 flow [2025-03-17 14:33:45,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 127 transitions, 1580 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-03-17 14:33:45,795 INFO L231 Difference]: Finished difference. Result has 97 places, 108 transitions, 1304 flow [2025-03-17 14:33:45,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1304, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2025-03-17 14:33:45,796 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2025-03-17 14:33:45,796 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 1304 flow [2025-03-17 14:33:45,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:33:45,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:45,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:45,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:33:45,796 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:33:45,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash -303224985, now seen corresponding path program 1 times [2025-03-17 14:33:45,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:45,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536716543] [2025-03-17 14:33:45,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:45,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:45,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:33:45,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:33:45,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:45,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:45,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536716543] [2025-03-17 14:33:45,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536716543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:45,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533182593] [2025-03-17 14:33:45,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:33:45,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:45,913 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:33:45,915 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:33:45,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:33:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:33:45,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:33:45,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:45,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 14:33:45,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:46,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:33:46,177 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:33:46,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:51,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 141 treesize of output 125 [2025-03-17 14:33:51,405 INFO L349 Elim1Store]: treesize reduction 5, result has 97.4 percent of original size [2025-03-17 14:33:51,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 221 treesize of output 338