./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-channel-sum.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 bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:11:18,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:11:18,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:11:18,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:11:18,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:11:18,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:11:18,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:11:18,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:11:18,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:11:18,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:11:18,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:11:18,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:11:18,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:11:18,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:11:18,936 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:11:18,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:11:18,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:11:18,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:11:18,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:11:18,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:11:18,936 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:11:18,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:11:18,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:18,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:11:18,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:11:18,938 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 -> bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 [2025-03-04 10:11:19,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:11:19,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:11:19,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:11:19,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:11:19,172 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:11:19,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2025-03-04 10:11:20,320 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ff715a4/ae6c0e7f73c74b9c89b099da1066c5ba/FLAG39d1fde46 [2025-03-04 10:11:20,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:11:20,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2025-03-04 10:11:20,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ff715a4/ae6c0e7f73c74b9c89b099da1066c5ba/FLAG39d1fde46 [2025-03-04 10:11:20,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ff715a4/ae6c0e7f73c74b9c89b099da1066c5ba [2025-03-04 10:11:20,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:11:20,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:11:20,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:20,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:11:20,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:11:20,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79600425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20, skipping insertion in model container [2025-03-04 10:11:20,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:11:20,745 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:11:20,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:20,758 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:11:20,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:20,792 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:11:20,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20 WrapperNode [2025-03-04 10:11:20,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:20,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:20,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:11:20,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:11:20,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,821 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 130 [2025-03-04 10:11:20,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:20,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:11:20,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:11:20,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:11:20,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,851 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:11:20,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:11:20,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:11:20,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:11:20,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:11:20,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (1/1) ... [2025-03-04 10:11:20,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:20,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:11:20,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:11:20,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:11:20,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:11:20,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:11:20,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:11:20,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:11:20,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:11:20,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:11:20,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:11:20,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:11:20,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:11:20,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:11:20,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:11:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:11:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:11:20,919 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:11:20,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:11:20,998 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:11:21,235 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:11:21,235 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:11:21,357 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:11:21,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:11:21,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:21 BoogieIcfgContainer [2025-03-04 10:11:21,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:11:21,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:11:21,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:11:21,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:11:21,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:11:20" (1/3) ... [2025-03-04 10:11:21,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e158c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:21, skipping insertion in model container [2025-03-04 10:11:21,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:20" (2/3) ... [2025-03-04 10:11:21,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e158c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:21, skipping insertion in model container [2025-03-04 10:11:21,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:21" (3/3) ... [2025-03-04 10:11:21,367 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2025-03-04 10:11:21,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:11:21,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 46 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-04 10:11:21,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:11:21,430 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:11:21,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 114 flow [2025-03-04 10:11:21,484 INFO L124 PetriNetUnfolderBase]: 5/48 cut-off events. [2025-03-04 10:11:21,486 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:21,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 48 events. 5/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 80 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-04 10:11:21,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 50 transitions, 114 flow [2025-03-04 10:11:21,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 47 transitions, 106 flow [2025-03-04 10:11:21,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:11:21,504 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;@3705ea42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:11:21,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 10:11:21,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:11:21,511 INFO L124 PetriNetUnfolderBase]: 1/8 cut-off events. [2025-03-04 10:11:21,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:11:21,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:21,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:21,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:21,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash -561446685, now seen corresponding path program 1 times [2025-03-04 10:11:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:21,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616852609] [2025-03-04 10:11:21,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:21,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:11:21,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:11:21,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:21,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:21,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616852609] [2025-03-04 10:11:21,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616852609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:21,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:21,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523963384] [2025-03-04 10:11:21,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:21,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:21,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:21,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:21,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-04 10:11:21,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:21,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:21,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-04 10:11:21,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:21,922 INFO L124 PetriNetUnfolderBase]: 237/477 cut-off events. [2025-03-04 10:11:21,922 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 10:11:21,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 477 events. 237/477 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2207 event pairs, 167 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 785. Up to 358 conditions per place. [2025-03-04 10:11:21,928 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 26 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-04 10:11:21,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 154 flow [2025-03-04 10:11:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-04 10:11:21,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-04 10:11:21,941 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 106 flow. Second operand 3 states and 85 transitions. [2025-03-04 10:11:21,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 154 flow [2025-03-04 10:11:21,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:21,947 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 94 flow [2025-03-04 10:11:21,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-03-04 10:11:21,952 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-03-04 10:11:21,952 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 94 flow [2025-03-04 10:11:21,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:21,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:21,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:21,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:11:21,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:21,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:21,954 INFO L85 PathProgramCache]: Analyzing trace with hash -561446684, now seen corresponding path program 1 times [2025-03-04 10:11:21,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:21,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967083745] [2025-03-04 10:11:21,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:21,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:21,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:11:21,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:11:21,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:22,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:22,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967083745] [2025-03-04 10:11:22,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967083745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:22,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:22,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692444997] [2025-03-04 10:11:22,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:22,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:22,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:22,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:22,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-04 10:11:22,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:22,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:22,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-04 10:11:22,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:22,358 INFO L124 PetriNetUnfolderBase]: 238/480 cut-off events. [2025-03-04 10:11:22,358 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:11:22,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 480 events. 238/480 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2220 event pairs, 167 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 828. Up to 363 conditions per place. [2025-03-04 10:11:22,363 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-03-04 10:11:22,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 166 flow [2025-03-04 10:11:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-04 10:11:22,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-04 10:11:22,367 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 94 flow. Second operand 4 states and 105 transitions. [2025-03-04 10:11:22,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 166 flow [2025-03-04 10:11:22,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:22,369 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 117 flow [2025-03-04 10:11:22,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-03-04 10:11:22,370 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-03-04 10:11:22,370 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 117 flow [2025-03-04 10:11:22,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:22,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:22,371 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:22,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:11:22,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:22,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1615627069, now seen corresponding path program 1 times [2025-03-04 10:11:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:22,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870049266] [2025-03-04 10:11:22,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:22,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:11:22,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:11:22,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:22,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870049266] [2025-03-04 10:11:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870049266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516559731] [2025-03-04 10:11:22,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:22,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:22,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:22,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:22,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:11:22,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:11:22,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:11:22,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:22,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:22,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:11:22,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:22,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:11:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:22,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516559731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:22,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:22,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:11:22,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049416199] [2025-03-04 10:11:22,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:11:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:22,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:11:22,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:11:23,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-04 10:11:23,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 117 flow. Second operand has 11 states, 11 states have (on average 19.636363636363637) internal successors, (216), 11 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:23,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-04 10:11:23,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:23,291 INFO L124 PetriNetUnfolderBase]: 239/482 cut-off events. [2025-03-04 10:11:23,291 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 10:11:23,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 482 events. 239/482 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2271 event pairs, 167 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 842. Up to 360 conditions per place. [2025-03-04 10:11:23,294 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 24 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2025-03-04 10:11:23,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 193 flow [2025-03-04 10:11:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2025-03-04 10:11:23,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 10:11:23,298 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 117 flow. Second operand 8 states and 180 transitions. [2025-03-04 10:11:23,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 193 flow [2025-03-04 10:11:23,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:23,299 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 142 flow [2025-03-04 10:11:23,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=142, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-03-04 10:11:23,299 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2025-03-04 10:11:23,299 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 142 flow [2025-03-04 10:11:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.636363636363637) internal successors, (216), 11 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:23,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:23,322 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-04 10:11:23,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:23,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:23,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1452618667, now seen corresponding path program 1 times [2025-03-04 10:11:23,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626884636] [2025-03-04 10:11:23,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:23,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:23,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:11:23,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:11:23,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:23,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:23,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626884636] [2025-03-04 10:11:23,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626884636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:23,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552261763] [2025-03-04 10:11:23,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:23,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:23,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:23,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:23,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:23,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-03-04 10:11:23,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:23,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-03-04 10:11:23,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:23,624 INFO L124 PetriNetUnfolderBase]: 225/509 cut-off events. [2025-03-04 10:11:23,624 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:11:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 509 events. 225/509 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2418 event pairs, 88 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 888. Up to 254 conditions per place. [2025-03-04 10:11:23,628 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 41 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2025-03-04 10:11:23,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 264 flow [2025-03-04 10:11:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-04 10:11:23,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-03-04 10:11:23,629 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 142 flow. Second operand 3 states and 99 transitions. [2025-03-04 10:11:23,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 264 flow [2025-03-04 10:11:23,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 222 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 10:11:23,631 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 138 flow [2025-03-04 10:11:23,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2025-03-04 10:11:23,631 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-03-04 10:11:23,631 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 138 flow [2025-03-04 10:11:23,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:23,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:23,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:11:23,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 362714977, now seen corresponding path program 1 times [2025-03-04 10:11:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:23,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881668315] [2025-03-04 10:11:23,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:23,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:11:23,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:11:23,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:23,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:23,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:23,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881668315] [2025-03-04 10:11:23,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881668315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:23,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:23,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:23,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118757889] [2025-03-04 10:11:23,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:23,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:23,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:23,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:23,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-03-04 10:11:23,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:23,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-03-04 10:11:23,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:23,810 INFO L124 PetriNetUnfolderBase]: 225/459 cut-off events. [2025-03-04 10:11:23,810 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-03-04 10:11:23,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 459 events. 225/459 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1936 event pairs, 144 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 318. Up to 378 conditions per place. [2025-03-04 10:11:23,814 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 33 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-03-04 10:11:23,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 206 flow [2025-03-04 10:11:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 10:11:23,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.455 [2025-03-04 10:11:23,816 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 138 flow. Second operand 4 states and 91 transitions. [2025-03-04 10:11:23,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 206 flow [2025-03-04 10:11:23,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:23,818 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 128 flow [2025-03-04 10:11:23,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-03-04 10:11:23,818 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-03-04 10:11:23,818 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 128 flow [2025-03-04 10:11:23,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:23,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:23,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:11:23,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:23,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash 362714978, now seen corresponding path program 1 times [2025-03-04 10:11:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431594708] [2025-03-04 10:11:23,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:23,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:11:23,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:11:23,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:23,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431594708] [2025-03-04 10:11:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431594708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:11:23,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252958922] [2025-03-04 10:11:23,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:23,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:23,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:23,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:23,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-03-04 10:11:23,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:23,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-03-04 10:11:23,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:23,979 INFO L124 PetriNetUnfolderBase]: 247/515 cut-off events. [2025-03-04 10:11:23,979 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-04 10:11:23,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 515 events. 247/515 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2258 event pairs, 167 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 941. Up to 383 conditions per place. [2025-03-04 10:11:23,981 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 45 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-04 10:11:23,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 256 flow [2025-03-04 10:11:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-04 10:11:23,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:11:23,982 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 128 flow. Second operand 4 states and 120 transitions. [2025-03-04 10:11:23,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 256 flow [2025-03-04 10:11:23,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:23,984 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 136 flow [2025-03-04 10:11:23,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2025-03-04 10:11:23,985 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-03-04 10:11:23,985 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 136 flow [2025-03-04 10:11:23,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:23,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:23,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:11:23,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 411922153, now seen corresponding path program 1 times [2025-03-04 10:11:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541966794] [2025-03-04 10:11:23,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:23,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:11:24,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:24,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:24,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:24,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:24,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541966794] [2025-03-04 10:11:24,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541966794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:24,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27619115] [2025-03-04 10:11:24,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:24,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:24,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:24,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:24,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-04 10:11:24,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:11:24,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:24,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:24,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:24,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:11:24,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:24,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27619115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:24,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:24,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:11:24,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864200810] [2025-03-04 10:11:24,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:24,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:24,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:24,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:24,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-04 10:11:24,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:24,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:24,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-04 10:11:24,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:24,438 INFO L124 PetriNetUnfolderBase]: 247/509 cut-off events. [2025-03-04 10:11:24,438 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 10:11:24,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 509 events. 247/509 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2123 event pairs, 107 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 967. Up to 300 conditions per place. [2025-03-04 10:11:24,440 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 36 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2025-03-04 10:11:24,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 245 flow [2025-03-04 10:11:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-04 10:11:24,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.488 [2025-03-04 10:11:24,442 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 136 flow. Second operand 5 states and 122 transitions. [2025-03-04 10:11:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 245 flow [2025-03-04 10:11:24,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 237 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:24,444 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 142 flow [2025-03-04 10:11:24,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-03-04 10:11:24,444 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2025-03-04 10:11:24,444 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 142 flow [2025-03-04 10:11:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:24,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:24,444 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] [2025-03-04 10:11:24,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:24,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 10:11:24,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:24,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:24,646 INFO L85 PathProgramCache]: Analyzing trace with hash 359198292, now seen corresponding path program 1 times [2025-03-04 10:11:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:24,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657713795] [2025-03-04 10:11:24,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:24,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:24,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:24,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:24,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:24,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:24,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657713795] [2025-03-04 10:11:24,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657713795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:24,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:24,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:24,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507473228] [2025-03-04 10:11:24,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:24,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:24,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:24,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:24,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:24,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-03-04 10:11:24,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:24,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:24,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-03-04 10:11:24,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:24,798 INFO L124 PetriNetUnfolderBase]: 354/730 cut-off events. [2025-03-04 10:11:24,798 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-03-04 10:11:24,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 730 events. 354/730 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3211 event pairs, 155 based on Foata normal form. 3/684 useless extension candidates. Maximal degree in co-relation 1504. Up to 367 conditions per place. [2025-03-04 10:11:24,803 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 50 selfloop transitions, 2 changer transitions 3/64 dead transitions. [2025-03-04 10:11:24,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 314 flow [2025-03-04 10:11:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-04 10:11:24,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-04 10:11:24,804 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 142 flow. Second operand 3 states and 102 transitions. [2025-03-04 10:11:24,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 314 flow [2025-03-04 10:11:24,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:24,807 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 128 flow [2025-03-04 10:11:24,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-03-04 10:11:24,808 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-03-04 10:11:24,808 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 128 flow [2025-03-04 10:11:24,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:24,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:24,808 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] [2025-03-04 10:11:24,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:11:24,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:24,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash 633136470, now seen corresponding path program 1 times [2025-03-04 10:11:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:24,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121511900] [2025-03-04 10:11:24,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:24,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:24,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:24,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:24,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121511900] [2025-03-04 10:11:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121511900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:24,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:24,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642853824] [2025-03-04 10:11:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:24,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:24,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:24,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:24,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-04 10:11:24,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:24,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:24,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-04 10:11:24,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:25,111 INFO L124 PetriNetUnfolderBase]: 333/661 cut-off events. [2025-03-04 10:11:25,111 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 10:11:25,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 661 events. 333/661 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2911 event pairs, 51 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 1447. Up to 238 conditions per place. [2025-03-04 10:11:25,114 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 64 selfloop transitions, 12 changer transitions 3/87 dead transitions. [2025-03-04 10:11:25,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 400 flow [2025-03-04 10:11:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-03-04 10:11:25,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-04 10:11:25,115 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 128 flow. Second operand 7 states and 196 transitions. [2025-03-04 10:11:25,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 400 flow [2025-03-04 10:11:25,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 386 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:25,117 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 170 flow [2025-03-04 10:11:25,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-03-04 10:11:25,117 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2025-03-04 10:11:25,117 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 170 flow [2025-03-04 10:11:25,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:25,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:25,117 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:25,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:11:25,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:25,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:25,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1229361050, now seen corresponding path program 1 times [2025-03-04 10:11:25,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:25,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530184698] [2025-03-04 10:11:25,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:25,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:11:25,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:11:25,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:25,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:25,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:25,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530184698] [2025-03-04 10:11:25,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530184698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:25,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112185203] [2025-03-04 10:11:25,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:25,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:25,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:25,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:25,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:11:25,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:11:25,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:11:25,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:25,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:11:25,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:25,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112185203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:25,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:25,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-04 10:11:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174121074] [2025-03-04 10:11:25,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:25,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:11:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:25,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:11:25,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:11:25,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-04 10:11:25,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 170 flow. Second operand has 17 states, 17 states have (on average 20.823529411764707) internal successors, (354), 17 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:25,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:25,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-04 10:11:25,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:26,094 INFO L124 PetriNetUnfolderBase]: 549/1103 cut-off events. [2025-03-04 10:11:26,094 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-03-04 10:11:26,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 1103 events. 549/1103 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5681 event pairs, 291 based on Foata normal form. 16/1035 useless extension candidates. Maximal degree in co-relation 1539. Up to 591 conditions per place. [2025-03-04 10:11:26,099 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 78 selfloop transitions, 15 changer transitions 13/114 dead transitions. [2025-03-04 10:11:26,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 114 transitions, 584 flow [2025-03-04 10:11:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:11:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:11:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 310 transitions. [2025-03-04 10:11:26,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-04 10:11:26,101 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 170 flow. Second operand 12 states and 310 transitions. [2025-03-04 10:11:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 114 transitions, 584 flow [2025-03-04 10:11:26,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 114 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:26,102 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 255 flow [2025-03-04 10:11:26,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=255, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-03-04 10:11:26,103 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2025-03-04 10:11:26,103 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 255 flow [2025-03-04 10:11:26,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.823529411764707) internal successors, (354), 17 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:26,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:26,105 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:26,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:26,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1859242189, now seen corresponding path program 2 times [2025-03-04 10:11:26,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:26,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245062088] [2025-03-04 10:11:26,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:26,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:26,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 26 statements. [2025-03-04 10:11:26,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:26,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:11:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245062088] [2025-03-04 10:11:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245062088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683340769] [2025-03-04 10:11:26,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:26,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:26,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:26,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:26,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:11:26,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:26,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 26 statements. [2025-03-04 10:11:26,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:26,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:26,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:11:26,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:11:26,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:26,644 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 7 treesize of output 5 [2025-03-04 10:11:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:11:26,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683340769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:26,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:26,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 10:11:26,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979849850] [2025-03-04 10:11:26,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:26,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:11:26,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:26,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:11:26,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:11:26,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-04 10:11:26,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 255 flow. Second operand has 15 states, 15 states have (on average 21.133333333333333) internal successors, (317), 15 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:26,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:26,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-04 10:11:26,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:27,022 INFO L124 PetriNetUnfolderBase]: 527/1101 cut-off events. [2025-03-04 10:11:27,022 INFO L125 PetriNetUnfolderBase]: For 935/935 co-relation queries the response was YES. [2025-03-04 10:11:27,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2887 conditions, 1101 events. 527/1101 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5763 event pairs, 114 based on Foata normal form. 16/1075 useless extension candidates. Maximal degree in co-relation 1947. Up to 506 conditions per place. [2025-03-04 10:11:27,027 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 40 selfloop transitions, 31 changer transitions 3/82 dead transitions. [2025-03-04 10:11:27,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 517 flow [2025-03-04 10:11:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:11:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:11:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2025-03-04 10:11:27,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-04 10:11:27,028 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 255 flow. Second operand 9 states and 216 transitions. [2025-03-04 10:11:27,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 517 flow [2025-03-04 10:11:27,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 496 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:11:27,032 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 356 flow [2025-03-04 10:11:27,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=356, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-03-04 10:11:27,033 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2025-03-04 10:11:27,034 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 356 flow [2025-03-04 10:11:27,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.133333333333333) internal successors, (317), 15 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:27,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:27,034 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:27,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:27,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:27,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1065941484, now seen corresponding path program 1 times [2025-03-04 10:11:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287171568] [2025-03-04 10:11:27,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:27,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:11:27,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:11:27,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:27,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287171568] [2025-03-04 10:11:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287171568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432764749] [2025-03-04 10:11:27,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:27,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:27,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:27,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:27,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:11:27,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:11:27,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:11:27,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:27,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:27,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:11:27,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:27,681 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 23 treesize of output 1 [2025-03-04 10:11:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:27,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:28,250 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 61 treesize of output 55 [2025-03-04 10:11:28,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:28,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-03-04 10:11:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:28,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432764749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:28,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:28,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-03-04 10:11:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558157259] [2025-03-04 10:11:28,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:28,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:11:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:28,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:11:28,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:11:28,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-03-04 10:11:28,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 356 flow. Second operand has 29 states, 29 states have (on average 21.448275862068964) internal successors, (622), 29 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:28,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:28,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-03-04 10:11:28,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:30,628 INFO L124 PetriNetUnfolderBase]: 1573/3167 cut-off events. [2025-03-04 10:11:30,628 INFO L125 PetriNetUnfolderBase]: For 3708/3708 co-relation queries the response was YES. [2025-03-04 10:11:30,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9046 conditions, 3167 events. 1573/3167 cut-off events. For 3708/3708 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 21485 event pairs, 110 based on Foata normal form. 35/3093 useless extension candidates. Maximal degree in co-relation 5586. Up to 521 conditions per place. [2025-03-04 10:11:30,641 INFO L140 encePairwiseOnDemand]: 33/50 looper letters, 177 selfloop transitions, 96 changer transitions 200/481 dead transitions. [2025-03-04 10:11:30,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 481 transitions, 3187 flow [2025-03-04 10:11:30,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-04 10:11:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-03-04 10:11:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 1442 transitions. [2025-03-04 10:11:30,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.534074074074074 [2025-03-04 10:11:30,646 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 356 flow. Second operand 54 states and 1442 transitions. [2025-03-04 10:11:30,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 481 transitions, 3187 flow [2025-03-04 10:11:30,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 481 transitions, 2971 flow, removed 101 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:30,661 INFO L231 Difference]: Finished difference. Result has 149 places, 150 transitions, 1272 flow [2025-03-04 10:11:30,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1272, PETRI_PLACES=149, PETRI_TRANSITIONS=150} [2025-03-04 10:11:30,662 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 100 predicate places. [2025-03-04 10:11:30,663 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 150 transitions, 1272 flow [2025-03-04 10:11:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 21.448275862068964) internal successors, (622), 29 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:30,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:30,664 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:30,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:30,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:11:30,865 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:30,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1632730884, now seen corresponding path program 1 times [2025-03-04 10:11:30,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:30,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910914123] [2025-03-04 10:11:30,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:30,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:11:30,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:11:30,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:30,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:11:30,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:30,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910914123] [2025-03-04 10:11:30,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910914123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:30,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:30,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:30,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504123495] [2025-03-04 10:11:30,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:30,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:30,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:30,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:30,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:30,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2025-03-04 10:11:30,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 150 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:30,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:30,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2025-03-04 10:11:30,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:31,080 INFO L124 PetriNetUnfolderBase]: 778/1478 cut-off events. [2025-03-04 10:11:31,080 INFO L125 PetriNetUnfolderBase]: For 9892/9892 co-relation queries the response was YES. [2025-03-04 10:11:31,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6456 conditions, 1478 events. 778/1478 cut-off events. For 9892/9892 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7282 event pairs, 231 based on Foata normal form. 4/1481 useless extension candidates. Maximal degree in co-relation 6403. Up to 1269 conditions per place. [2025-03-04 10:11:31,089 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 103 selfloop transitions, 2 changer transitions 6/117 dead transitions. [2025-03-04 10:11:31,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 117 transitions, 1155 flow [2025-03-04 10:11:31,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 10:11:31,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-04 10:11:31,094 INFO L175 Difference]: Start difference. First operand has 149 places, 150 transitions, 1272 flow. Second operand 3 states and 96 transitions. [2025-03-04 10:11:31,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 117 transitions, 1155 flow [2025-03-04 10:11:31,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 117 transitions, 990 flow, removed 69 selfloop flow, removed 32 redundant places. [2025-03-04 10:11:31,107 INFO L231 Difference]: Finished difference. Result has 82 places, 96 transitions, 636 flow [2025-03-04 10:11:31,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=82, PETRI_TRANSITIONS=96} [2025-03-04 10:11:31,108 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2025-03-04 10:11:31,108 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 96 transitions, 636 flow [2025-03-04 10:11:31,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:31,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:31,108 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:31,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:11:31,108 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1474344329, now seen corresponding path program 2 times [2025-03-04 10:11:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040129464] [2025-03-04 10:11:31,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:31,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:11:31,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:11:31,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:31,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:11:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040129464] [2025-03-04 10:11:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040129464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:11:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204442323] [2025-03-04 10:11:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:31,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:31,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:31,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:31,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-03-04 10:11:31,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 96 transitions, 636 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 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-04 10:11:31,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:31,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-03-04 10:11:31,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:31,372 INFO L124 PetriNetUnfolderBase]: 1134/2163 cut-off events. [2025-03-04 10:11:31,373 INFO L125 PetriNetUnfolderBase]: For 4230/4234 co-relation queries the response was YES. [2025-03-04 10:11:31,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7536 conditions, 2163 events. 1134/2163 cut-off events. For 4230/4234 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10948 event pairs, 292 based on Foata normal form. 34/2188 useless extension candidates. Maximal degree in co-relation 7481. Up to 889 conditions per place. [2025-03-04 10:11:31,383 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 129 selfloop transitions, 40 changer transitions 1/179 dead transitions. [2025-03-04 10:11:31,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 179 transitions, 1546 flow [2025-03-04 10:11:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 10:11:31,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-04 10:11:31,385 INFO L175 Difference]: Start difference. First operand has 82 places, 96 transitions, 636 flow. Second operand 4 states and 136 transitions. [2025-03-04 10:11:31,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 179 transitions, 1546 flow [2025-03-04 10:11:31,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 179 transitions, 1524 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:31,394 INFO L231 Difference]: Finished difference. Result has 81 places, 128 transitions, 1082 flow [2025-03-04 10:11:31,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1082, PETRI_PLACES=81, PETRI_TRANSITIONS=128} [2025-03-04 10:11:31,395 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2025-03-04 10:11:31,395 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 128 transitions, 1082 flow [2025-03-04 10:11:31,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 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-04 10:11:31,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:31,395 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:31,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:11:31,396 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1657047562, now seen corresponding path program 3 times [2025-03-04 10:11:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326955027] [2025-03-04 10:11:31,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:31,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-04 10:11:31,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 46 statements. [2025-03-04 10:11:31,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:11:31,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:11:31,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326955027] [2025-03-04 10:11:31,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326955027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:31,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:31,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:11:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617090297] [2025-03-04 10:11:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:31,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:31,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:31,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:31,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2025-03-04 10:11:31,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 128 transitions, 1082 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:31,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:31,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2025-03-04 10:11:31,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:31,775 INFO L124 PetriNetUnfolderBase]: 1778/3215 cut-off events. [2025-03-04 10:11:31,775 INFO L125 PetriNetUnfolderBase]: For 8091/8091 co-relation queries the response was YES. [2025-03-04 10:11:31,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11764 conditions, 3215 events. 1778/3215 cut-off events. For 8091/8091 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 16052 event pairs, 401 based on Foata normal form. 158/3372 useless extension candidates. Maximal degree in co-relation 11708. Up to 1638 conditions per place. [2025-03-04 10:11:31,796 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 146 selfloop transitions, 4 changer transitions 2/157 dead transitions. [2025-03-04 10:11:31,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1620 flow [2025-03-04 10:11:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-04 10:11:31,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-04 10:11:31,798 INFO L175 Difference]: Start difference. First operand has 81 places, 128 transitions, 1082 flow. Second operand 4 states and 112 transitions. [2025-03-04 10:11:31,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1620 flow [2025-03-04 10:11:31,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 157 transitions, 1612 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:31,814 INFO L231 Difference]: Finished difference. Result has 86 places, 122 transitions, 1021 flow [2025-03-04 10:11:31,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1021, PETRI_PLACES=86, PETRI_TRANSITIONS=122} [2025-03-04 10:11:31,815 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 37 predicate places. [2025-03-04 10:11:31,815 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 122 transitions, 1021 flow [2025-03-04 10:11:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:31,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:31,816 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:31,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:11:31,816 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:31,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1555363550, now seen corresponding path program 1 times [2025-03-04 10:11:31,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:31,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406007402] [2025-03-04 10:11:31,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:31,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:31,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:11:31,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:11:31,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:31,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406007402] [2025-03-04 10:11:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406007402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854236823] [2025-03-04 10:11:32,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:32,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:32,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:32,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:32,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:11:32,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:11:32,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:11:32,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:32,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:32,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 10:11:32,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:32,691 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 23 treesize of output 1 [2025-03-04 10:11:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:33,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:33,814 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 117 treesize of output 105 [2025-03-04 10:11:33,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:33,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 208 [2025-03-04 10:11:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854236823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:34,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 45 [2025-03-04 10:11:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807695079] [2025-03-04 10:11:34,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:34,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 10:11:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:34,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 10:11:34,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1781, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:11:35,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-03-04 10:11:35,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 122 transitions, 1021 flow. Second operand has 46 states, 46 states have (on average 21.282608695652176) internal successors, (979), 46 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:35,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:35,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-03-04 10:11:35,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:55,365 INFO L124 PetriNetUnfolderBase]: 12415/24683 cut-off events. [2025-03-04 10:11:55,366 INFO L125 PetriNetUnfolderBase]: For 64393/64393 co-relation queries the response was YES. [2025-03-04 10:11:55,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88538 conditions, 24683 events. 12415/24683 cut-off events. For 64393/64393 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 206259 event pairs, 794 based on Foata normal form. 249/24844 useless extension candidates. Maximal degree in co-relation 81046. Up to 4220 conditions per place. [2025-03-04 10:11:55,478 INFO L140 encePairwiseOnDemand]: 33/50 looper letters, 967 selfloop transitions, 1387 changer transitions 555/2919 dead transitions. [2025-03-04 10:11:55,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 2919 transitions, 24838 flow [2025-03-04 10:11:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2025-03-04 10:11:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2025-03-04 10:11:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 8702 transitions. [2025-03-04 10:11:55,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5088888888888888 [2025-03-04 10:11:55,493 INFO L175 Difference]: Start difference. First operand has 86 places, 122 transitions, 1021 flow. Second operand 342 states and 8702 transitions. [2025-03-04 10:11:55,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 2919 transitions, 24838 flow [2025-03-04 10:11:55,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 2919 transitions, 24818 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:55,605 INFO L231 Difference]: Finished difference. Result has 533 places, 1563 transitions, 18340 flow [2025-03-04 10:11:55,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=342, PETRI_FLOW=18340, PETRI_PLACES=533, PETRI_TRANSITIONS=1563} [2025-03-04 10:11:55,607 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 484 predicate places. [2025-03-04 10:11:55,607 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 1563 transitions, 18340 flow [2025-03-04 10:11:55,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 21.282608695652176) internal successors, (979), 46 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:55,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:55,608 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:55,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:55,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:11:55,813 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:11:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash -199201508, now seen corresponding path program 2 times [2025-03-04 10:11:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077999502] [2025-03-04 10:11:55,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:55,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 10:11:55,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:11:55,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:55,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:56,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:56,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077999502] [2025-03-04 10:11:56,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077999502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:56,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184708545] [2025-03-04 10:11:56,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:56,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:56,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:56,620 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:56,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:11:56,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 10:11:56,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:11:56,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:56,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:56,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 10:11:56,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:56,775 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 23 treesize of output 1 [2025-03-04 10:11:57,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:57,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 28 [2025-03-04 10:11:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:57,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:58,400 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 138 treesize of output 126 [2025-03-04 10:11:58,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:58,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 241 treesize of output 258 [2025-03-04 10:12:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:12:01,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184708545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:01,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:01,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 57 [2025-03-04 10:12:01,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554153466] [2025-03-04 10:12:01,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:01,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-04 10:12:01,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:01,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-04 10:12:01,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2841, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 10:12:02,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2025-03-04 10:12:02,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 1563 transitions, 18340 flow. Second operand has 58 states, 58 states have (on average 20.844827586206897) internal successors, (1209), 58 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:02,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:02,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2025-03-04 10:12:02,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand