./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.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-bad-counter-queue.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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:10:52,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:10:52,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:10:52,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:10:52,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:10:52,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:10:52,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:10:52,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:10:52,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:10:52,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:10:52,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:10:52,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:10:52,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:10:52,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:10:52,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:10:52,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:10:52,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:10:52,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:10:52,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:10:52,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:10:52,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:10:52,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:10:52,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:10:52,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:10:52,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:10:52,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:52,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:10:52,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:10:52,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:10:52,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:10:52,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:10:52,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:10:52,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:10:52,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:10:52,428 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-03-04 10:10:52,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:10:52,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:10:52,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:10:52,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:10:52,677 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:10:52,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-03-04 10:10:53,787 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1a6f97b/195f183053b24968af4c3e6c0bb8c083/FLAG79c877335 [2025-03-04 10:10:54,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:10:54,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-03-04 10:10:54,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1a6f97b/195f183053b24968af4c3e6c0bb8c083/FLAG79c877335 [2025-03-04 10:10:54,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1a6f97b/195f183053b24968af4c3e6c0bb8c083 [2025-03-04 10:10:54,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:10:54,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:10:54,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:54,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:10:54,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:10:54,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ce9961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54, skipping insertion in model container [2025-03-04 10:10:54,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:10:54,233 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:10:54,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:54,245 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:10:54,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:54,280 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:10:54,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54 WrapperNode [2025-03-04 10:10:54,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:54,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:54,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:10:54,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:10:54,286 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:10:54" (1/1) ... [2025-03-04 10:10:54,291 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:10:54" (1/1) ... [2025-03-04 10:10:54,309 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 127 [2025-03-04 10:10:54,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:54,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:10:54,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:10:54,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:10:54,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,336 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 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:10:54,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:10:54,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:10:54,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:10:54,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:10:54,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (1/1) ... [2025-03-04 10:10:54,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:54,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:54,383 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:10:54,385 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:10:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:10:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:10:54,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:10:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:10:54,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:10:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:10:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:10:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:10:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:10:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:10:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:10:54,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:10:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:10:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:10:54,405 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:10:54,487 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:10:54,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:10:54,693 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:10:54,693 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:10:54,845 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:10:54,845 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:10:54,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:54 BoogieIcfgContainer [2025-03-04 10:10:54,846 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:10:54,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:10:54,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:10:54,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:10:54,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:10:54" (1/3) ... [2025-03-04 10:10:54,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2ec3e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:54, skipping insertion in model container [2025-03-04 10:10:54,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:54" (2/3) ... [2025-03-04 10:10:54,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2ec3e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:54, skipping insertion in model container [2025-03-04 10:10:54,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:54" (3/3) ... [2025-03-04 10:10:54,854 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-03-04 10:10:54,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:10:54,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 10:10:54,866 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:10:54,902 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:10:54,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2025-03-04 10:10:54,942 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2025-03-04 10:10:54,944 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:10:54,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-03-04 10:10:54,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2025-03-04 10:10:54,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2025-03-04 10:10:54,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:10:54,968 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;@28d76ec4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:10:54,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 10:10:54,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:10:54,974 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:10:54,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:10:54,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:54,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:54,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:54,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash 385404, now seen corresponding path program 1 times [2025-03-04 10:10:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126355725] [2025-03-04 10:10:54,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:54,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:55,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:55,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:55,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:55,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:55,179 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:10:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126355725] [2025-03-04 10:10:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126355725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:55,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:55,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:10:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625087196] [2025-03-04 10:10:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:55,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:55,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:55,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:55,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:10:55,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:10:55,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:55,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:10:55,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:55,307 INFO L124 PetriNetUnfolderBase]: 92/179 cut-off events. [2025-03-04 10:10:55,308 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:10:55,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 179 events. 92/179 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 603 event pairs, 68 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 315. Up to 160 conditions per place. [2025-03-04 10:10:55,312 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 19 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-03-04 10:10:55,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 112 flow [2025-03-04 10:10:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 10:10:55,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 10:10:55,324 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 56 transitions. [2025-03-04 10:10:55,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 112 flow [2025-03-04 10:10:55,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:55,329 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-03-04 10:10:55,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-04 10:10:55,335 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-04 10:10:55,335 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-03-04 10:10:55,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:10:55,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:55,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:55,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:10:55,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:55,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash 385405, now seen corresponding path program 1 times [2025-03-04 10:10:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687063999] [2025-03-04 10:10:55,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:55,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:55,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:55,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:55,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:55,549 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:10:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:55,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687063999] [2025-03-04 10:10:55,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687063999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:55,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:55,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:55,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737792196] [2025-03-04 10:10:55,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:55,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:55,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:55,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:55,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:10:55,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:55,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:55,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:10:55,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:55,668 INFO L124 PetriNetUnfolderBase]: 92/178 cut-off events. [2025-03-04 10:10:55,669 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:10:55,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 178 events. 92/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 614 event pairs, 68 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 338. Up to 160 conditions per place. [2025-03-04 10:10:55,670 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 17 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-03-04 10:10:55,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 106 flow [2025-03-04 10:10:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-03-04 10:10:55,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2025-03-04 10:10:55,671 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 66 transitions. [2025-03-04 10:10:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 106 flow [2025-03-04 10:10:55,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:55,672 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 68 flow [2025-03-04 10:10:55,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2025-03-04 10:10:55,673 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-04 10:10:55,673 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 68 flow [2025-03-04 10:10:55,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:55,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:55,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:10:55,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:10:55,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:55,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1400906315, now seen corresponding path program 1 times [2025-03-04 10:10:55,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:55,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957824589] [2025-03-04 10:10:55,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:55,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:55,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:10:55,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:10:55,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:55,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:55,740 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:10:55,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957824589] [2025-03-04 10:10:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957824589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:55,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137427222] [2025-03-04 10:10:55,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:55,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:55,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:55,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:55,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-04 10:10:55,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:10:55,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:55,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-04 10:10:55,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:55,843 INFO L124 PetriNetUnfolderBase]: 92/173 cut-off events. [2025-03-04 10:10:55,844 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:10:55,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 173 events. 92/173 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 568 event pairs, 68 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 333. Up to 159 conditions per place. [2025-03-04 10:10:55,845 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 19 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-03-04 10:10:55,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 106 flow [2025-03-04 10:10:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-04 10:10:55,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2025-03-04 10:10:55,847 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 68 flow. Second operand 4 states and 59 transitions. [2025-03-04 10:10:55,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 106 flow [2025-03-04 10:10:55,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:55,848 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 60 flow [2025-03-04 10:10:55,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2025-03-04 10:10:55,848 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2025-03-04 10:10:55,848 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 60 flow [2025-03-04 10:10:55,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:10:55,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:55,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:10:55,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:10:55,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:55,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1400906314, now seen corresponding path program 1 times [2025-03-04 10:10:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13430206] [2025-03-04 10:10:55,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:55,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:55,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:10:55,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:10:55,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:55,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:55,910 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:10:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13430206] [2025-03-04 10:10:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13430206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:55,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:55,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:10:55,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033389435] [2025-03-04 10:10:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:55,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:55,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:55,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:55,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:55,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:10:55,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:10:55,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:55,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:10:55,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:56,026 INFO L124 PetriNetUnfolderBase]: 154/300 cut-off events. [2025-03-04 10:10:56,026 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:10:56,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 300 events. 154/300 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1146 event pairs, 101 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 394. Up to 192 conditions per place. [2025-03-04 10:10:56,029 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 42 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2025-03-04 10:10:56,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 51 transitions, 211 flow [2025-03-04 10:10:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-04 10:10:56,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2025-03-04 10:10:56,032 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 60 flow. Second operand 5 states and 103 transitions. [2025-03-04 10:10:56,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 51 transitions, 211 flow [2025-03-04 10:10:56,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:56,034 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 94 flow [2025-03-04 10:10:56,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-03-04 10:10:56,036 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-03-04 10:10:56,036 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 94 flow [2025-03-04 10:10:56,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:10:56,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:56,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:56,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:10:56,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:56,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:56,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1976187604, now seen corresponding path program 1 times [2025-03-04 10:10:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747817878] [2025-03-04 10:10:56,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:56,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:10:56,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:10:56,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:56,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:56,123 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:10:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:56,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747817878] [2025-03-04 10:10:56,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747817878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:56,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:10:56,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114613124] [2025-03-04 10:10:56,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:56,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:56,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:56,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:56,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:56,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:10:56,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:10:56,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:56,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:10:56,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:56,213 INFO L124 PetriNetUnfolderBase]: 130/257 cut-off events. [2025-03-04 10:10:56,213 INFO L125 PetriNetUnfolderBase]: For 74/86 co-relation queries the response was YES. [2025-03-04 10:10:56,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 257 events. 130/257 cut-off events. For 74/86 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 917 event pairs, 96 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 427. Up to 190 conditions per place. [2025-03-04 10:10:56,214 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 35 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-03-04 10:10:56,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 215 flow [2025-03-04 10:10:56,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-04 10:10:56,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-03-04 10:10:56,216 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 94 flow. Second operand 5 states and 96 transitions. [2025-03-04 10:10:56,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 215 flow [2025-03-04 10:10:56,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:56,217 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 117 flow [2025-03-04 10:10:56,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-03-04 10:10:56,219 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-03-04 10:10:56,219 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 117 flow [2025-03-04 10:10:56,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:10:56,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:56,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:56,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:10:56,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:56,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 422842717, now seen corresponding path program 1 times [2025-03-04 10:10:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851604272] [2025-03-04 10:10:56,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:56,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:10:56,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:10:56,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:56,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:56,404 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:10:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:56,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851604272] [2025-03-04 10:10:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851604272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137317442] [2025-03-04 10:10:56,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:56,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:56,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:56,408 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:10:56,410 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:10:56,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:10:56,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:10:56,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:56,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:56,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:10:56,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:56,484 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:10:56,524 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:10:56,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:56,590 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:10:56,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137317442] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:56,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:10:56,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 6 [2025-03-04 10:10:56,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755762384] [2025-03-04 10:10:56,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:56,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:10:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:56,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:10:56,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:10:56,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:10:56,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:10:56,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:56,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:10:56,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:56,751 INFO L124 PetriNetUnfolderBase]: 160/309 cut-off events. [2025-03-04 10:10:56,751 INFO L125 PetriNetUnfolderBase]: For 119/135 co-relation queries the response was YES. [2025-03-04 10:10:56,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 309 events. 160/309 cut-off events. For 119/135 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1199 event pairs, 75 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 578. Up to 130 conditions per place. [2025-03-04 10:10:56,754 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 38 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2025-03-04 10:10:56,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 256 flow [2025-03-04 10:10:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-04 10:10:56,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2025-03-04 10:10:56,756 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 117 flow. Second operand 6 states and 113 transitions. [2025-03-04 10:10:56,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 256 flow [2025-03-04 10:10:56,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:56,757 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 149 flow [2025-03-04 10:10:56,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-03-04 10:10:56,758 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2025-03-04 10:10:56,758 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 149 flow [2025-03-04 10:10:56,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:10:56,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:56,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:56,767 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:10:56,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:10:56,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:56,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1700025581, now seen corresponding path program 1 times [2025-03-04 10:10:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:56,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413174693] [2025-03-04 10:10:56,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:56,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:56,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:56,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:56,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:57,118 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:10:57,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:57,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413174693] [2025-03-04 10:10:57,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413174693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:57,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201520031] [2025-03-04 10:10:57,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:57,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:57,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:57,121 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:10:57,123 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:10:57,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:57,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:57,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:57,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:57,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:10:57,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:57,248 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:10:57,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:57,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:10:57,316 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:10:57,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201520031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:57,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 10:10:57,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712290987] [2025-03-04 10:10:57,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:57,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:10:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:57,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:10:57,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:10:57,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:10:57,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 149 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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:10:57,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:57,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:10:57,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:57,555 INFO L124 PetriNetUnfolderBase]: 240/446 cut-off events. [2025-03-04 10:10:57,556 INFO L125 PetriNetUnfolderBase]: For 575/631 co-relation queries the response was YES. [2025-03-04 10:10:57,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 446 events. 240/446 cut-off events. For 575/631 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1726 event pairs, 88 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 1079. Up to 179 conditions per place. [2025-03-04 10:10:57,558 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 51 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2025-03-04 10:10:57,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 389 flow [2025-03-04 10:10:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:10:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:10:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2025-03-04 10:10:57,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2025-03-04 10:10:57,560 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 149 flow. Second operand 7 states and 132 transitions. [2025-03-04 10:10:57,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 389 flow [2025-03-04 10:10:57,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 375 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:57,562 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 180 flow [2025-03-04 10:10:57,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2025-03-04 10:10:57,565 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2025-03-04 10:10:57,566 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 180 flow [2025-03-04 10:10:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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:10:57,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:57,566 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:57,572 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:10:57,766 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:10:57,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:57,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1419887618, now seen corresponding path program 1 times [2025-03-04 10:10:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222131214] [2025-03-04 10:10:57,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:57,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:10:57,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:10:57,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:57,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:57,859 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:10:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:57,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222131214] [2025-03-04 10:10:57,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222131214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:57,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210176686] [2025-03-04 10:10:57,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:57,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:57,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:57,864 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:10:57,865 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:10:57,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:10:57,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:10:57,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:57,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:57,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:10:57,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:57,963 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:10:57,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:58,008 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:10:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210176686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:58,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:58,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:10:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843048030] [2025-03-04 10:10:58,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:58,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:10:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:58,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:10:58,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:10:58,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:10:58,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 180 flow. Second operand has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 14 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:58,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:58,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:10:58,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:58,285 INFO L124 PetriNetUnfolderBase]: 481/891 cut-off events. [2025-03-04 10:10:58,286 INFO L125 PetriNetUnfolderBase]: For 1078/1106 co-relation queries the response was YES. [2025-03-04 10:10:58,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 891 events. 481/891 cut-off events. For 1078/1106 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4003 event pairs, 252 based on Foata normal form. 18/908 useless extension candidates. Maximal degree in co-relation 1410. Up to 410 conditions per place. [2025-03-04 10:10:58,293 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 70 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2025-03-04 10:10:58,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 577 flow [2025-03-04 10:10:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-03-04 10:10:58,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-04 10:10:58,295 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 180 flow. Second operand 8 states and 152 transitions. [2025-03-04 10:10:58,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 577 flow [2025-03-04 10:10:58,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 556 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:58,302 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 271 flow [2025-03-04 10:10:58,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=271, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2025-03-04 10:10:58,303 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2025-03-04 10:10:58,304 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 271 flow [2025-03-04 10:10:58,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.142857142857142) internal successors, (184), 14 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:58,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:58,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:58,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:10:58,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:58,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:58,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1974985223, now seen corresponding path program 1 times [2025-03-04 10:10:58,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:58,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945381431] [2025-03-04 10:10:58,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:58,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:58,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:10:58,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:10:58,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:58,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:58,529 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:10:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:58,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945381431] [2025-03-04 10:10:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945381431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:58,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:58,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278228020] [2025-03-04 10:10:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:58,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:58,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:58,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:58,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:58,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-03-04 10:10:58,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:10:58,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:58,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-03-04 10:10:58,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:58,642 INFO L124 PetriNetUnfolderBase]: 436/854 cut-off events. [2025-03-04 10:10:58,642 INFO L125 PetriNetUnfolderBase]: For 2080/2164 co-relation queries the response was YES. [2025-03-04 10:10:58,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 854 events. 436/854 cut-off events. For 2080/2164 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4251 event pairs, 122 based on Foata normal form. 3/854 useless extension candidates. Maximal degree in co-relation 1407. Up to 526 conditions per place. [2025-03-04 10:10:58,647 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 45 selfloop transitions, 3 changer transitions 6/59 dead transitions. [2025-03-04 10:10:58,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 458 flow [2025-03-04 10:10:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 10:10:58,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-04 10:10:58,648 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 271 flow. Second operand 3 states and 71 transitions. [2025-03-04 10:10:58,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 458 flow [2025-03-04 10:10:58,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 445 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:58,652 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 240 flow [2025-03-04 10:10:58,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-03-04 10:10:58,652 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2025-03-04 10:10:58,652 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 240 flow [2025-03-04 10:10:58,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:10:58,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:58,653 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:58,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:10:58,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:58,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash -900440471, now seen corresponding path program 2 times [2025-03-04 10:10:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:58,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048123658] [2025-03-04 10:10:58,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:58,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:10:58,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:10:58,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:10:58,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:10:58,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:58,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048123658] [2025-03-04 10:10:58,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048123658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647601970] [2025-03-04 10:10:58,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:58,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:58,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:58,888 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:10:58,889 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:10:58,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:10:58,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:10:58,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:10:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:58,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:10:58,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:59,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:59,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:10:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647601970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:59,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:10:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740202433] [2025-03-04 10:10:59,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:59,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:10:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:59,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:10:59,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:10:59,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:10:59,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 240 flow. Second operand has 20 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 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:10:59,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:59,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:10:59,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:00,154 INFO L124 PetriNetUnfolderBase]: 673/1179 cut-off events. [2025-03-04 10:11:00,155 INFO L125 PetriNetUnfolderBase]: For 1887/1959 co-relation queries the response was YES. [2025-03-04 10:11:00,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4204 conditions, 1179 events. 673/1179 cut-off events. For 1887/1959 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5407 event pairs, 120 based on Foata normal form. 36/1215 useless extension candidates. Maximal degree in co-relation 2710. Up to 195 conditions per place. [2025-03-04 10:11:00,161 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 128 selfloop transitions, 18 changer transitions 0/149 dead transitions. [2025-03-04 10:11:00,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 149 transitions, 1042 flow [2025-03-04 10:11:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 254 transitions. [2025-03-04 10:11:00,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-03-04 10:11:00,164 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 240 flow. Second operand 14 states and 254 transitions. [2025-03-04 10:11:00,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 149 transitions, 1042 flow [2025-03-04 10:11:00,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 149 transitions, 976 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:00,169 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 292 flow [2025-03-04 10:11:00,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=292, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-03-04 10:11:00,169 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2025-03-04 10:11:00,169 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 292 flow [2025-03-04 10:11:00,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 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:00,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:00,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:00,177 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:00,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:00,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:00,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1196600136, now seen corresponding path program 1 times [2025-03-04 10:11:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:00,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846185065] [2025-03-04 10:11:00,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:00,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:00,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:11:00,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:11:00,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:00,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:00,444 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:00,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:00,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846185065] [2025-03-04 10:11:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846185065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:00,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835825240] [2025-03-04 10:11:00,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:00,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:00,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:00,446 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:00,448 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:00,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:11:00,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:11:00,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:00,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:00,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:00,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:00,547 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:00,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:00,589 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:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835825240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:00,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:11:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832388734] [2025-03-04 10:11:00,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:00,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:11:00,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:00,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:11:00,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:11:00,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:00,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 292 flow. Second operand has 14 states, 14 states have (on average 13.285714285714286) internal successors, (186), 14 states have internal predecessors, (186), 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:00,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:00,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:00,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:00,802 INFO L124 PetriNetUnfolderBase]: 607/1075 cut-off events. [2025-03-04 10:11:00,802 INFO L125 PetriNetUnfolderBase]: For 2742/2760 co-relation queries the response was YES. [2025-03-04 10:11:00,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 1075 events. 607/1075 cut-off events. For 2742/2760 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4778 event pairs, 380 based on Foata normal form. 13/1084 useless extension candidates. Maximal degree in co-relation 2725. Up to 727 conditions per place. [2025-03-04 10:11:00,809 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 66 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2025-03-04 10:11:00,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 638 flow [2025-03-04 10:11:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-03-04 10:11:00,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-03-04 10:11:00,811 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 292 flow. Second operand 8 states and 149 transitions. [2025-03-04 10:11:00,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 638 flow [2025-03-04 10:11:00,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 547 flow, removed 10 selfloop flow, removed 11 redundant places. [2025-03-04 10:11:00,817 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 296 flow [2025-03-04 10:11:00,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2025-03-04 10:11:00,818 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2025-03-04 10:11:00,818 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 296 flow [2025-03-04 10:11:00,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.285714285714286) internal successors, (186), 14 states have internal predecessors, (186), 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:00,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:00,819 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:00,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:11:01,023 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,SelfDestructingSolverStorable10 [2025-03-04 10:11:01,023 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1943867041, now seen corresponding path program 2 times [2025-03-04 10:11:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631501173] [2025-03-04 10:11:01,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:01,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:01,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:01,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:01,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:11:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631501173] [2025-03-04 10:11:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631501173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137519055] [2025-03-04 10:11:01,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:01,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:01,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:01,203 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:01,205 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:01,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:01,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:01,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:01,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:01,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:11:01,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:01,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:01,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:11:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137519055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:01,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:11:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715672466] [2025-03-04 10:11:01,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:01,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:11:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:01,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:11:01,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:11:01,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:01,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 296 flow. Second operand has 20 states, 20 states have (on average 12.35) internal successors, (247), 20 states have internal predecessors, (247), 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:01,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:01,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:01,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:02,471 INFO L124 PetriNetUnfolderBase]: 782/1306 cut-off events. [2025-03-04 10:11:02,472 INFO L125 PetriNetUnfolderBase]: For 2056/2080 co-relation queries the response was YES. [2025-03-04 10:11:02,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4576 conditions, 1306 events. 782/1306 cut-off events. For 2056/2080 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5497 event pairs, 122 based on Foata normal form. 46/1350 useless extension candidates. Maximal degree in co-relation 3440. Up to 262 conditions per place. [2025-03-04 10:11:02,478 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 122 selfloop transitions, 18 changer transitions 0/144 dead transitions. [2025-03-04 10:11:02,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 144 transitions, 1062 flow [2025-03-04 10:11:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 247 transitions. [2025-03-04 10:11:02,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5040816326530613 [2025-03-04 10:11:02,480 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 296 flow. Second operand 14 states and 247 transitions. [2025-03-04 10:11:02,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 144 transitions, 1062 flow [2025-03-04 10:11:02,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 144 transitions, 1049 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:02,484 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 345 flow [2025-03-04 10:11:02,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=345, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2025-03-04 10:11:02,484 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 38 predicate places. [2025-03-04 10:11:02,484 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 345 flow [2025-03-04 10:11:02,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.35) internal successors, (247), 20 states have internal predecessors, (247), 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:02,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:02,485 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:02,491 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:02,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:02,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:02,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1853754359, now seen corresponding path program 1 times [2025-03-04 10:11:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834531621] [2025-03-04 10:11:02,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:02,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:02,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:02,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:02,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:02,739 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:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834531621] [2025-03-04 10:11:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834531621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168486240] [2025-03-04 10:11:02,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:02,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:02,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:02,742 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:02,744 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:02,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:02,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:02,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:02,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:02,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:11:02,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:02,821 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:02,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:02,848 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:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168486240] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 10:11:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440964862] [2025-03-04 10:11:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:02,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:02,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:02,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:02,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:02,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:02,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:02,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:02,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:02,962 INFO L124 PetriNetUnfolderBase]: 732/1241 cut-off events. [2025-03-04 10:11:02,963 INFO L125 PetriNetUnfolderBase]: For 2954/2978 co-relation queries the response was YES. [2025-03-04 10:11:02,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 1241 events. 732/1241 cut-off events. For 2954/2978 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5311 event pairs, 171 based on Foata normal form. 42/1281 useless extension candidates. Maximal degree in co-relation 3593. Up to 774 conditions per place. [2025-03-04 10:11:02,970 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 55 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2025-03-04 10:11:02,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 565 flow [2025-03-04 10:11:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-03-04 10:11:02,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2025-03-04 10:11:02,971 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 345 flow. Second operand 5 states and 87 transitions. [2025-03-04 10:11:02,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 565 flow [2025-03-04 10:11:02,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 521 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-04 10:11:02,974 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 325 flow [2025-03-04 10:11:02,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2025-03-04 10:11:02,975 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2025-03-04 10:11:02,975 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 325 flow [2025-03-04 10:11:02,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:02,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:02,975 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:02,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:03,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:03,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:03,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1749166277, now seen corresponding path program 1 times [2025-03-04 10:11:03,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335203666] [2025-03-04 10:11:03,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:03,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:03,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:03,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:03,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:03,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335203666] [2025-03-04 10:11:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335203666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002458532] [2025-03-04 10:11:03,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:03,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:03,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:03,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:11:03,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:03,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:03,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:03,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:03,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:11:03,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:03,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:03,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002458532] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:03,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:03,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 10:11:03,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871501973] [2025-03-04 10:11:03,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:03,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:03,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:03,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:03,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:03,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:03,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:03,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:03,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:03,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:03,464 INFO L124 PetriNetUnfolderBase]: 674/1178 cut-off events. [2025-03-04 10:11:03,465 INFO L125 PetriNetUnfolderBase]: For 3018/3032 co-relation queries the response was YES. [2025-03-04 10:11:03,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4305 conditions, 1178 events. 674/1178 cut-off events. For 3018/3032 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5103 event pairs, 181 based on Foata normal form. 38/1189 useless extension candidates. Maximal degree in co-relation 3482. Up to 738 conditions per place. [2025-03-04 10:11:03,471 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 52 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2025-03-04 10:11:03,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 542 flow [2025-03-04 10:11:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-04 10:11:03,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2025-03-04 10:11:03,472 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 325 flow. Second operand 5 states and 88 transitions. [2025-03-04 10:11:03,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 542 flow [2025-03-04 10:11:03,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 519 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:03,477 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 332 flow [2025-03-04 10:11:03,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-03-04 10:11:03,478 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 36 predicate places. [2025-03-04 10:11:03,478 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 332 flow [2025-03-04 10:11:03,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:03,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:03,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:03,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:03,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:11:03,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:03,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1651282932, now seen corresponding path program 1 times [2025-03-04 10:11:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:03,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036451696] [2025-03-04 10:11:03,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:03,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:11:03,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:11:03,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:03,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:11:03,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:11:03,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:11:03,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:11:03,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:03,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:11:03,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:11:03,735 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:11:03,735 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-04 10:11:03,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-03-04 10:11:03,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:11:03,742 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:03,777 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:11:03,777 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:11:03,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:11:03 BasicIcfg [2025-03-04 10:11:03,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:11:03,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:11:03,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:11:03,781 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:11:03,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:54" (3/4) ... [2025-03-04 10:11:03,783 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:11:03,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:11:03,784 INFO L158 Benchmark]: Toolchain (without parser) took 9697.01ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 107.8MB in the beginning and 163.9MB in the end (delta: -56.1MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2025-03-04 10:11:03,784 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 126.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:11:03,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.29ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 95.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:11:03,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.45ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:11:03,785 INFO L158 Benchmark]: Boogie Preprocessor took 37.49ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:11:03,785 INFO L158 Benchmark]: IcfgBuilder took 495.98ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 50.9MB in the end (delta: 40.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 10:11:03,785 INFO L158 Benchmark]: TraceAbstraction took 8932.79ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 49.8MB in the beginning and 163.9MB in the end (delta: -114.2MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2025-03-04 10:11:03,785 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 285.2MB. Free memory was 163.9MB in the beginning and 163.9MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:11:03,788 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 126.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.29ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 95.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.45ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.49ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 495.98ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 50.9MB in the end (delta: 40.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8932.79ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 49.8MB in the beginning and 163.9MB in the end (delta: -114.2MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 285.2MB. Free memory was 163.9MB in the beginning and 163.9MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=1, counter=0, t1=-5] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=1, counter=0, t1=-5, t2=-4] [L57] 2 int i=0; VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] 1 int i=0; VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=5, i=0, tmp=5] [L59] 2 counter = tmp VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-5, i=0, tmp=-5] [L48] 1 i++ VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-5, i=1] [L48] COND FALSE 1 !(i 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-03-04 10:11:05,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:11:05,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:11:05,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:11:05,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:11:05,954 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:11:05,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-03-04 10:11:07,184 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1389ff4c4/4f63206e00584d61b040a76a4e51c7ce/FLAG48ef064a9 [2025-03-04 10:11:07,372 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:11:07,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-03-04 10:11:07,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1389ff4c4/4f63206e00584d61b040a76a4e51c7ce/FLAG48ef064a9 [2025-03-04 10:11:07,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1389ff4c4/4f63206e00584d61b040a76a4e51c7ce [2025-03-04 10:11:07,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:11:07,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:11:07,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:07,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:11:07,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:11:07,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:07" (1/1) ... [2025-03-04 10:11:07,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5210cd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:07, skipping insertion in model container [2025-03-04 10:11:07,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:07" (1/1) ... [2025-03-04 10:11:07,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:11:07,532 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:07,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:07,544 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:11:07,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:07,578 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:11:07,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:07 WrapperNode [2025-03-04 10:11:07,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:07,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:07,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:11:07,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:11:07,584 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:07" (1/1) ... [2025-03-04 10:11:07,592 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:07" (1/1) ... [2025-03-04 10:11:07,608 INFO L138 Inliner]: procedures = 25, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 123 [2025-03-04 10:11:07,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:07,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:11:07,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:11:07,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:11:07,615 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:07" (1/1) ... [2025-03-04 10:11:07,615 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:07" (1/1) ... [2025-03-04 10:11:07,619 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:07" (1/1) ... [2025-03-04 10:11:07,633 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 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:07,634 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:07" (1/1) ... [2025-03-04 10:11:07,634 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:07" (1/1) ... [2025-03-04 10:11:07,640 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:07" (1/1) ... [2025-03-04 10:11:07,640 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:07" (1/1) ... [2025-03-04 10:11:07,644 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:07" (1/1) ... [2025-03-04 10:11:07,645 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:07" (1/1) ... [2025-03-04 10:11:07,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:11:07,647 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:11:07,647 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:11:07,647 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:11:07,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:07" (1/1) ... [2025-03-04 10:11:07,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:07,678 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:07,680 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:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:11:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:11:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:11:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:11:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:11:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 10:11:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 10:11:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:11:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 10:11:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 10:11:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:11:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:11:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 10:11:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 10:11:07,702 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:07,791 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:11:07,793 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:11:08,096 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:11:08,096 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:11:08,300 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:11:08,300 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:11:08,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:08 BoogieIcfgContainer [2025-03-04 10:11:08,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:11:08,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:11:08,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:11:08,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:11:08,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:11:07" (1/3) ... [2025-03-04 10:11:08,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c410200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:08, skipping insertion in model container [2025-03-04 10:11:08,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:07" (2/3) ... [2025-03-04 10:11:08,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c410200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:08, skipping insertion in model container [2025-03-04 10:11:08,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:08" (3/3) ... [2025-03-04 10:11:08,306 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-03-04 10:11:08,315 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:11:08,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 10:11:08,316 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:11:08,359 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:11:08,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2025-03-04 10:11:08,411 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2025-03-04 10:11:08,414 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-03-04 10:11:08,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2025-03-04 10:11:08,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2025-03-04 10:11:08,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:11:08,435 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;@6ea1b71b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:11:08,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 10:11:08,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:11:08,439 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:11:08,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:11:08,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:08,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:11:08,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 380436, now seen corresponding path program 1 times [2025-03-04 10:11:08,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:08,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138935363] [2025-03-04 10:11:08,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:08,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:08,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:08,456 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:08,457 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:08,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:11:08,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:11:08,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:08,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:08,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:11:08,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:08,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 10:11:08,577 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:08,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:08,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:08,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138935363] [2025-03-04 10:11:08,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138935363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:08,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:08,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:11:08,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987891776] [2025-03-04 10:11:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:08,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:08,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:08,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:08,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:08,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:08,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:08,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:08,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:08,715 INFO L124 PetriNetUnfolderBase]: 92/179 cut-off events. [2025-03-04 10:11:08,716 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:11:08,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 179 events. 92/179 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 610 event pairs, 68 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 315. Up to 160 conditions per place. [2025-03-04 10:11:08,718 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 19 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-03-04 10:11:08,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 112 flow [2025-03-04 10:11:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 10:11:08,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 10:11:08,728 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 56 transitions. [2025-03-04 10:11:08,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 112 flow [2025-03-04 10:11:08,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:08,732 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-03-04 10:11:08,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-04 10:11:08,736 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-04 10:11:08,736 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-03-04 10:11:08,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:08,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:08,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:11:08,743 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:08,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:08,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 380437, now seen corresponding path program 1 times [2025-03-04 10:11:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:08,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874037702] [2025-03-04 10:11:08,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:08,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:08,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:08,941 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:08,952 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:09,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:11:09,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:11:09,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:09,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:11:09,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:09,024 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 7 [2025-03-04 10:11:09,092 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:09,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:09,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874037702] [2025-03-04 10:11:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874037702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897798778] [2025-03-04 10:11:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:09,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:09,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:09,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:09,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:09,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:09,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:09,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:09,286 INFO L124 PetriNetUnfolderBase]: 93/182 cut-off events. [2025-03-04 10:11:09,286 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:09,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 182 events. 93/182 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 628 event pairs, 68 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 338. Up to 165 conditions per place. [2025-03-04 10:11:09,288 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 21 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-03-04 10:11:09,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 124 flow [2025-03-04 10:11:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-03-04 10:11:09,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 10:11:09,294 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 70 transitions. [2025-03-04 10:11:09,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 124 flow [2025-03-04 10:11:09,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:09,296 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2025-03-04 10:11:09,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-03-04 10:11:09,297 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-03-04 10:11:09,297 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2025-03-04 10:11:09,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:09,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:09,297 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:11:09,304 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:09,502 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 [2025-03-04 10:11:09,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:09,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash 365612331, now seen corresponding path program 1 times [2025-03-04 10:11:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506864300] [2025-03-04 10:11:09,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:09,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:09,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:09,505 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:09,505 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:09,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:11:09,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:11:09,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:09,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:09,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:09,568 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 7 [2025-03-04 10:11:09,660 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:09,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:09,806 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:09,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506864300] [2025-03-04 10:11:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506864300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:09,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:09,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-04 10:11:09,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953959957] [2025-03-04 10:11:09,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:09,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:11:09,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:09,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:11:09,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:11:09,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:09,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 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:09,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:09,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:09,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:10,277 INFO L124 PetriNetUnfolderBase]: 96/191 cut-off events. [2025-03-04 10:11:10,277 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:10,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 191 events. 96/191 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 685 event pairs, 68 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 345. Up to 168 conditions per place. [2025-03-04 10:11:10,278 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 21 selfloop transitions, 13 changer transitions 0/41 dead transitions. [2025-03-04 10:11:10,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 193 flow [2025-03-04 10:11:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:11:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:11:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2025-03-04 10:11:10,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-03-04 10:11:10,281 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 10 states and 147 transitions. [2025-03-04 10:11:10,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 193 flow [2025-03-04 10:11:10,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:10,283 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 166 flow [2025-03-04 10:11:10,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=166, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-03-04 10:11:10,284 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2025-03-04 10:11:10,284 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 166 flow [2025-03-04 10:11:10,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 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:10,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:10,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:11:10,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:11:10,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:10,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1548915947, now seen corresponding path program 1 times [2025-03-04 10:11:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734530961] [2025-03-04 10:11:10,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:10,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:10,487 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:10,488 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:10,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:11:10,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:11:10,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:10,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:11:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:10,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 10:11:10,547 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:10,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:10,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734530961] [2025-03-04 10:11:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734530961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:10,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:10,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:10,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145415619] [2025-03-04 10:11:10,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:10,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:10,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:10,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:10,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-04 10:11:10,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:10,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:10,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-04 10:11:10,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:10,629 INFO L124 PetriNetUnfolderBase]: 96/186 cut-off events. [2025-03-04 10:11:10,629 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:11:10,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 186 events. 96/186 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 629 event pairs, 68 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 380. Up to 163 conditions per place. [2025-03-04 10:11:10,630 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 27 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2025-03-04 10:11:10,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 228 flow [2025-03-04 10:11:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-04 10:11:10,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2025-03-04 10:11:10,633 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 166 flow. Second operand 4 states and 59 transitions. [2025-03-04 10:11:10,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 228 flow [2025-03-04 10:11:10,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 198 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:10,634 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 144 flow [2025-03-04 10:11:10,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-03-04 10:11:10,635 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-03-04 10:11:10,635 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 144 flow [2025-03-04 10:11:10,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:10,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:10,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:11:10,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:11:10,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:10,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1548915946, now seen corresponding path program 1 times [2025-03-04 10:11:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:10,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595719513] [2025-03-04 10:11:10,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:10,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:10,839 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:10,840 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:10,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:11:10,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:11:10,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:10,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:10,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:10,929 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:10,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:10,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:10,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595719513] [2025-03-04 10:11:10,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595719513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:10,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:10,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:11:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545087261] [2025-03-04 10:11:10,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:10,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:10,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:10,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:10,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:10,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:10,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:10,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:10,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:11,082 INFO L124 PetriNetUnfolderBase]: 157/310 cut-off events. [2025-03-04 10:11:11,082 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 10:11:11,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 310 events. 157/310 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1251 event pairs, 106 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 620. Up to 201 conditions per place. [2025-03-04 10:11:11,084 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 51 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-03-04 10:11:11,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 305 flow [2025-03-04 10:11:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-04 10:11:11,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2025-03-04 10:11:11,087 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 144 flow. Second operand 5 states and 103 transitions. [2025-03-04 10:11:11,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 305 flow [2025-03-04 10:11:11,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:11,089 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 162 flow [2025-03-04 10:11:11,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-03-04 10:11:11,090 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2025-03-04 10:11:11,090 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 162 flow [2025-03-04 10:11:11,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:11,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:11,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:11,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:11:11,290 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 [2025-03-04 10:11:11,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:11,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash -77722560, now seen corresponding path program 1 times [2025-03-04 10:11:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232052078] [2025-03-04 10:11:11,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:11,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:11,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:11,293 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:11,294 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:11,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:11:11,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:11:11,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:11,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:11,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:11,346 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 7 [2025-03-04 10:11:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:11,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:11,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232052078] [2025-03-04 10:11:11,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232052078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:11,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:11,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-03-04 10:11:11,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351689460] [2025-03-04 10:11:11,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:11,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:11:11,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:11,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:11:11,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:11:12,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:12,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 162 flow. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 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:12,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:12,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:12,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:12,988 INFO L124 PetriNetUnfolderBase]: 463/872 cut-off events. [2025-03-04 10:11:12,988 INFO L125 PetriNetUnfolderBase]: For 131/152 co-relation queries the response was YES. [2025-03-04 10:11:12,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 872 events. 463/872 cut-off events. For 131/152 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4405 event pairs, 197 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 1670. Up to 222 conditions per place. [2025-03-04 10:11:12,995 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 88 selfloop transitions, 23 changer transitions 0/115 dead transitions. [2025-03-04 10:11:12,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 115 transitions, 556 flow [2025-03-04 10:11:12,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:11:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:11:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 240 transitions. [2025-03-04 10:11:13,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5274725274725275 [2025-03-04 10:11:13,000 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 162 flow. Second operand 13 states and 240 transitions. [2025-03-04 10:11:13,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 115 transitions, 556 flow [2025-03-04 10:11:13,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 115 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:13,005 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 254 flow [2025-03-04 10:11:13,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=254, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-03-04 10:11:13,007 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2025-03-04 10:11:13,007 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 254 flow [2025-03-04 10:11:13,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 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:13,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:13,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:13,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:11:13,208 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 [2025-03-04 10:11:13,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:13,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:13,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1815443852, now seen corresponding path program 1 times [2025-03-04 10:11:13,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:13,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313276615] [2025-03-04 10:11:13,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:13,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:13,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:13,212 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:13,213 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:13,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:11:13,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:11:13,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:13,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:13,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:13,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:13,301 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:13,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:13,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:13,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313276615] [2025-03-04 10:11:13,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313276615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:13,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:13,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:11:13,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890125891] [2025-03-04 10:11:13,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:13,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:13,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:13,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:13,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:13,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:13,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:13,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:13,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:13,483 INFO L124 PetriNetUnfolderBase]: 453/893 cut-off events. [2025-03-04 10:11:13,483 INFO L125 PetriNetUnfolderBase]: For 621/652 co-relation queries the response was YES. [2025-03-04 10:11:13,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2358 conditions, 893 events. 453/893 cut-off events. For 621/652 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4502 event pairs, 332 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 2178. Up to 733 conditions per place. [2025-03-04 10:11:13,488 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 55 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-03-04 10:11:13,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 413 flow [2025-03-04 10:11:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-04 10:11:13,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-03-04 10:11:13,489 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 254 flow. Second operand 5 states and 96 transitions. [2025-03-04 10:11:13,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 413 flow [2025-03-04 10:11:13,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 398 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:13,495 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 264 flow [2025-03-04 10:11:13,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-03-04 10:11:13,496 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2025-03-04 10:11:13,497 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 264 flow [2025-03-04 10:11:13,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:13,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:13,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:13,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:11:13,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:13,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:13,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1706919882, now seen corresponding path program 1 times [2025-03-04 10:11:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [878108018] [2025-03-04 10:11:13,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:13,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:13,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:13,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:11:13,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:11:13,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:11:13,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:13,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:13,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:13,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:13,757 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 7 [2025-03-04 10:11:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:13,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:14,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878108018] [2025-03-04 10:11:14,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878108018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:14,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:14,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-03-04 10:11:14,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348429045] [2025-03-04 10:11:14,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:14,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:11:14,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:14,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:11:14,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:11:14,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:14,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 264 flow. Second operand has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 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:14,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:14,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:14,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:15,189 INFO L124 PetriNetUnfolderBase]: 585/1094 cut-off events. [2025-03-04 10:11:15,190 INFO L125 PetriNetUnfolderBase]: For 812/929 co-relation queries the response was YES. [2025-03-04 10:11:15,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2977 conditions, 1094 events. 585/1094 cut-off events. For 812/929 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5537 event pairs, 232 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 2776. Up to 231 conditions per place. [2025-03-04 10:11:15,195 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 99 selfloop transitions, 23 changer transitions 0/126 dead transitions. [2025-03-04 10:11:15,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 126 transitions, 770 flow [2025-03-04 10:11:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:11:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:11:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 236 transitions. [2025-03-04 10:11:15,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5186813186813187 [2025-03-04 10:11:15,199 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 264 flow. Second operand 13 states and 236 transitions. [2025-03-04 10:11:15,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 126 transitions, 770 flow [2025-03-04 10:11:15,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 126 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:15,203 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 356 flow [2025-03-04 10:11:15,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=356, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2025-03-04 10:11:15,204 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 37 predicate places. [2025-03-04 10:11:15,204 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 356 flow [2025-03-04 10:11:15,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 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:15,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:15,205 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 10:11:15,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:11:15,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:15,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:15,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash 4372845, now seen corresponding path program 2 times [2025-03-04 10:11:15,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:15,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350324744] [2025-03-04 10:11:15,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:15,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:15,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:15,408 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:15,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:11:15,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:11:15,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:11:15,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:15,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:15,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:11:15,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:15,463 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 7 [2025-03-04 10:11:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:15,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:16,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350324744] [2025-03-04 10:11:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350324744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:16,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:16,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-03-04 10:11:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567641052] [2025-03-04 10:11:16,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:16,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:11:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:16,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:11:16,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:11:16,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:16,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 356 flow. Second operand has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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:16,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:16,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:16,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:18,009 INFO L124 PetriNetUnfolderBase]: 527/1060 cut-off events. [2025-03-04 10:11:18,009 INFO L125 PetriNetUnfolderBase]: For 1135/1212 co-relation queries the response was YES. [2025-03-04 10:11:18,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3300 conditions, 1060 events. 527/1060 cut-off events. For 1135/1212 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5656 event pairs, 372 based on Foata normal form. 6/1065 useless extension candidates. Maximal degree in co-relation 2993. Up to 877 conditions per place. [2025-03-04 10:11:18,015 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 47 selfloop transitions, 31 changer transitions 0/83 dead transitions. [2025-03-04 10:11:18,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 650 flow [2025-03-04 10:11:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:11:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:11:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 300 transitions. [2025-03-04 10:11:18,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2025-03-04 10:11:18,017 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 356 flow. Second operand 22 states and 300 transitions. [2025-03-04 10:11:18,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 650 flow [2025-03-04 10:11:18,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 83 transitions, 618 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 10:11:18,021 INFO L231 Difference]: Finished difference. Result has 95 places, 83 transitions, 554 flow [2025-03-04 10:11:18,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=554, PETRI_PLACES=95, PETRI_TRANSITIONS=83} [2025-03-04 10:11:18,023 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 59 predicate places. [2025-03-04 10:11:18,023 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 83 transitions, 554 flow [2025-03-04 10:11:18,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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:18,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:18,023 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:18,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:18,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:18,224 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:18,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash -910568603, now seen corresponding path program 1 times [2025-03-04 10:11:18,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:18,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430842953] [2025-03-04 10:11:18,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:18,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:18,227 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:18,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:11:18,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:11:18,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:11:18,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:18,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:18,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:11:18,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:18,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:18,423 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:18,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430842953] [2025-03-04 10:11:18,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430842953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:18,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:18,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 10:11:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999609023] [2025-03-04 10:11:18,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:18,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:11:18,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:18,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:11:18,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:11:18,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:18,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 83 transitions, 554 flow. Second operand has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:18,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:18,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:18,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:18,796 INFO L124 PetriNetUnfolderBase]: 542/1025 cut-off events. [2025-03-04 10:11:18,796 INFO L125 PetriNetUnfolderBase]: For 1049/1121 co-relation queries the response was YES. [2025-03-04 10:11:18,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3276 conditions, 1025 events. 542/1025 cut-off events. For 1049/1121 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5119 event pairs, 270 based on Foata normal form. 18/1043 useless extension candidates. Maximal degree in co-relation 3211. Up to 525 conditions per place. [2025-03-04 10:11:18,801 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 83 selfloop transitions, 29 changer transitions 0/117 dead transitions. [2025-03-04 10:11:18,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 117 transitions, 916 flow [2025-03-04 10:11:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-03-04 10:11:18,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-04 10:11:18,803 INFO L175 Difference]: Start difference. First operand has 95 places, 83 transitions, 554 flow. Second operand 8 states and 152 transitions. [2025-03-04 10:11:18,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 117 transitions, 916 flow [2025-03-04 10:11:18,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 117 transitions, 836 flow, removed 27 selfloop flow, removed 9 redundant places. [2025-03-04 10:11:18,810 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 538 flow [2025-03-04 10:11:18,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2025-03-04 10:11:18,811 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 57 predicate places. [2025-03-04 10:11:18,811 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 538 flow [2025-03-04 10:11:18,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:18,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:18,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:18,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:11:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:19,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1207899739, now seen corresponding path program 1 times [2025-03-04 10:11:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686698795] [2025-03-04 10:11:19,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:19,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:19,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:19,015 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:19,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:11:19,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:11:19,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:11:19,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:19,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:19,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:11:19,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:19,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:19,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:19,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686698795] [2025-03-04 10:11:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686698795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:19,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:19,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 10:11:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264885290] [2025-03-04 10:11:19,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:11:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:19,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:11:19,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:11:19,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:19,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 538 flow. Second operand has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 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:19,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:19,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:19,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:19,514 INFO L124 PetriNetUnfolderBase]: 479/898 cut-off events. [2025-03-04 10:11:19,515 INFO L125 PetriNetUnfolderBase]: For 1326/1424 co-relation queries the response was YES. [2025-03-04 10:11:19,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3065 conditions, 898 events. 479/898 cut-off events. For 1326/1424 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4152 event pairs, 262 based on Foata normal form. 13/911 useless extension candidates. Maximal degree in co-relation 3001. Up to 519 conditions per place. [2025-03-04 10:11:19,518 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 75 selfloop transitions, 29 changer transitions 0/109 dead transitions. [2025-03-04 10:11:19,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 109 transitions, 880 flow [2025-03-04 10:11:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2025-03-04 10:11:19,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-04 10:11:19,520 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 538 flow. Second operand 8 states and 150 transitions. [2025-03-04 10:11:19,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 109 transitions, 880 flow [2025-03-04 10:11:19,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 843 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:19,524 INFO L231 Difference]: Finished difference. Result has 97 places, 81 transitions, 585 flow [2025-03-04 10:11:19,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=585, PETRI_PLACES=97, PETRI_TRANSITIONS=81} [2025-03-04 10:11:19,524 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 61 predicate places. [2025-03-04 10:11:19,525 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 81 transitions, 585 flow [2025-03-04 10:11:19,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 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:19,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:19,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:19,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:11:19,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:19,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:19,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1424100123, now seen corresponding path program 1 times [2025-03-04 10:11:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:19,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076177309] [2025-03-04 10:11:19,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:19,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:19,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:19,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:19,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:11:19,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:11:19,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:11:19,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:19,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:19,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:11:19,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:19,781 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:19,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:19,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076177309] [2025-03-04 10:11:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076177309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:19,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:19,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262654631] [2025-03-04 10:11:19,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:19,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:19,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:19,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:19,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-03-04 10:11:19,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 81 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:19,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:19,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-03-04 10:11:19,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:19,889 INFO L124 PetriNetUnfolderBase]: 504/1029 cut-off events. [2025-03-04 10:11:19,889 INFO L125 PetriNetUnfolderBase]: For 1731/1877 co-relation queries the response was YES. [2025-03-04 10:11:19,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 1029 events. 504/1029 cut-off events. For 1731/1877 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5443 event pairs, 156 based on Foata normal form. 4/1032 useless extension candidates. Maximal degree in co-relation 3444. Up to 560 conditions per place. [2025-03-04 10:11:19,893 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 91 selfloop transitions, 3 changer transitions 6/106 dead transitions. [2025-03-04 10:11:19,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 106 transitions, 912 flow [2025-03-04 10:11:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 10:11:19,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-04 10:11:19,894 INFO L175 Difference]: Start difference. First operand has 97 places, 81 transitions, 585 flow. Second operand 3 states and 71 transitions. [2025-03-04 10:11:19,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 106 transitions, 912 flow [2025-03-04 10:11:19,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 855 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 10:11:19,898 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 508 flow [2025-03-04 10:11:19,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-03-04 10:11:19,899 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 59 predicate places. [2025-03-04 10:11:19,899 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 508 flow [2025-03-04 10:11:19,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:19,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:19,899 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:19,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:11:20,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:20,100 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:20,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1424793790, now seen corresponding path program 2 times [2025-03-04 10:11:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:20,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625133239] [2025-03-04 10:11:20,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:20,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:20,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:20,102 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:20,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:11:20,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:11:20,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 14 statements. [2025-03-04 10:11:20,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:20,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:20,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:11:20,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:20,152 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 7 [2025-03-04 10:11:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:11:20,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:20,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625133239] [2025-03-04 10:11:20,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625133239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:20,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:20,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:11:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232644071] [2025-03-04 10:11:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:20,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:20,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:20,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:20,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:20,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:20,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:20,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:20,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:20,554 INFO L124 PetriNetUnfolderBase]: 756/1380 cut-off events. [2025-03-04 10:11:20,554 INFO L125 PetriNetUnfolderBase]: For 2484/2667 co-relation queries the response was YES. [2025-03-04 10:11:20,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 1380 events. 756/1380 cut-off events. For 2484/2667 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7165 event pairs, 287 based on Foata normal form. 46/1423 useless extension candidates. Maximal degree in co-relation 4802. Up to 732 conditions per place. [2025-03-04 10:11:20,561 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 94 selfloop transitions, 25 changer transitions 0/123 dead transitions. [2025-03-04 10:11:20,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 123 transitions, 977 flow [2025-03-04 10:11:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-03-04 10:11:20,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2025-03-04 10:11:20,562 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 508 flow. Second operand 6 states and 107 transitions. [2025-03-04 10:11:20,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 123 transitions, 977 flow [2025-03-04 10:11:20,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 123 transitions, 896 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-03-04 10:11:20,569 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 584 flow [2025-03-04 10:11:20,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=584, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2025-03-04 10:11:20,570 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 54 predicate places. [2025-03-04 10:11:20,570 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 584 flow [2025-03-04 10:11:20,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:20,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:20,570 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:20,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:11:20,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:20,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:20,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash 376663311, now seen corresponding path program 2 times [2025-03-04 10:11:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:20,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025565853] [2025-03-04 10:11:20,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:20,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:20,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:20,774 INFO L229 MonitoredProcess]: Starting monitored process 15 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:20,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:11:20,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:11:20,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:11:20,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:20,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:20,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:11:20,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:20,837 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 7 [2025-03-04 10:11:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:21,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:21,435 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025565853] [2025-03-04 10:11:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025565853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:21,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2025-03-04 10:11:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343245276] [2025-03-04 10:11:21,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:21,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:11:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:21,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:11:21,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:11:21,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:21,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 584 flow. Second operand has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:21,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:21,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:21,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:23,521 INFO L124 PetriNetUnfolderBase]: 1294/2460 cut-off events. [2025-03-04 10:11:23,521 INFO L125 PetriNetUnfolderBase]: For 5118/5434 co-relation queries the response was YES. [2025-03-04 10:11:23,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8775 conditions, 2460 events. 1294/2460 cut-off events. For 5118/5434 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15022 event pairs, 420 based on Foata normal form. 56/2494 useless extension candidates. Maximal degree in co-relation 8720. Up to 551 conditions per place. [2025-03-04 10:11:23,534 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 178 selfloop transitions, 49 changer transitions 0/232 dead transitions. [2025-03-04 10:11:23,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 232 transitions, 1769 flow [2025-03-04 10:11:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:11:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:11:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 337 transitions. [2025-03-04 10:11:23,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5067669172932331 [2025-03-04 10:11:23,543 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 584 flow. Second operand 19 states and 337 transitions. [2025-03-04 10:11:23,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 232 transitions, 1769 flow [2025-03-04 10:11:23,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 232 transitions, 1726 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:23,554 INFO L231 Difference]: Finished difference. Result has 110 places, 103 transitions, 813 flow [2025-03-04 10:11:23,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=813, PETRI_PLACES=110, PETRI_TRANSITIONS=103} [2025-03-04 10:11:23,556 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 74 predicate places. [2025-03-04 10:11:23,556 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 103 transitions, 813 flow [2025-03-04 10:11:23,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:23,556 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:23,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:11:23,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:23,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:23,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1287187845, now seen corresponding path program 2 times [2025-03-04 10:11:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415128362] [2025-03-04 10:11:23,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:23,759 INFO L229 MonitoredProcess]: Starting monitored process 16 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:23,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:11:23,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:23,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:23,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:23,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:23,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:11:23,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:23,822 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 7 [2025-03-04 10:11:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:24,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:24,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415128362] [2025-03-04 10:11:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415128362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:24,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-03-04 10:11:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934926384] [2025-03-04 10:11:24,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:24,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:11:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:24,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:11:24,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:11:24,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:24,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 103 transitions, 813 flow. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:24,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:24,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:25,916 INFO L124 PetriNetUnfolderBase]: 2259/4110 cut-off events. [2025-03-04 10:11:25,916 INFO L125 PetriNetUnfolderBase]: For 13212/13473 co-relation queries the response was YES. [2025-03-04 10:11:25,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15882 conditions, 4110 events. 2259/4110 cut-off events. For 13212/13473 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 24832 event pairs, 635 based on Foata normal form. 142/4216 useless extension candidates. Maximal degree in co-relation 15819. Up to 1355 conditions per place. [2025-03-04 10:11:25,945 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 197 selfloop transitions, 32 changer transitions 0/234 dead transitions. [2025-03-04 10:11:25,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 234 transitions, 2321 flow [2025-03-04 10:11:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:11:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:11:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-04 10:11:25,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5012987012987012 [2025-03-04 10:11:25,946 INFO L175 Difference]: Start difference. First operand has 110 places, 103 transitions, 813 flow. Second operand 11 states and 193 transitions. [2025-03-04 10:11:25,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 234 transitions, 2321 flow [2025-03-04 10:11:25,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 234 transitions, 2231 flow, removed 36 selfloop flow, removed 7 redundant places. [2025-03-04 10:11:25,976 INFO L231 Difference]: Finished difference. Result has 116 places, 113 transitions, 952 flow [2025-03-04 10:11:25,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=952, PETRI_PLACES=116, PETRI_TRANSITIONS=113} [2025-03-04 10:11:25,977 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 80 predicate places. [2025-03-04 10:11:25,977 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 952 flow [2025-03-04 10:11:25,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:25,977 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:11:25,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:11:26,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:26,178 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1501285196, now seen corresponding path program 3 times [2025-03-04 10:11:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:26,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259703930] [2025-03-04 10:11:26,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:26,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:26,180 INFO L229 MonitoredProcess]: Starting monitored process 17 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,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:11:26,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-04 10:11:26,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:11:26,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:11:26,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:26,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:11:26,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:26,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:26,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:26,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259703930] [2025-03-04 10:11:26,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259703930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:26,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:26,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-04 10:11:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155136864] [2025-03-04 10:11:26,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:26,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:11:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:26,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:11:26,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:11:26,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:26,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 952 flow. Second operand has 18 states, 18 states have (on average 12.88888888888889) internal successors, (232), 18 states have internal predecessors, (232), 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,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:26,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:26,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:27,741 INFO L124 PetriNetUnfolderBase]: 2246/4023 cut-off events. [2025-03-04 10:11:27,741 INFO L125 PetriNetUnfolderBase]: For 14855/15026 co-relation queries the response was YES. [2025-03-04 10:11:27,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16977 conditions, 4023 events. 2246/4023 cut-off events. For 14855/15026 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 23365 event pairs, 1224 based on Foata normal form. 84/4104 useless extension candidates. Maximal degree in co-relation 16912. Up to 2613 conditions per place. [2025-03-04 10:11:27,763 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 178 selfloop transitions, 31 changer transitions 0/214 dead transitions. [2025-03-04 10:11:27,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 214 transitions, 1983 flow [2025-03-04 10:11:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 268 transitions. [2025-03-04 10:11:27,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-03-04 10:11:27,765 INFO L175 Difference]: Start difference. First operand has 116 places, 113 transitions, 952 flow. Second operand 14 states and 268 transitions. [2025-03-04 10:11:27,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 214 transitions, 1983 flow [2025-03-04 10:11:27,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 214 transitions, 1957 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:27,799 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 982 flow [2025-03-04 10:11:27,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=982, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2025-03-04 10:11:27,800 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 89 predicate places. [2025-03-04 10:11:27,800 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 982 flow [2025-03-04 10:11:27,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.88888888888889) internal successors, (232), 18 states have internal predecessors, (232), 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,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:27,800 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:27,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:11:28,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:28,001 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:28,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1150045226, now seen corresponding path program 3 times [2025-03-04 10:11:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985543904] [2025-03-04 10:11:28,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:28,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:28,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:28,003 INFO L229 MonitoredProcess]: Starting monitored process 18 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:28,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:11:28,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-03-04 10:11:28,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:28,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:11:28,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:28,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:11:28,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:28,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:28,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985543904] [2025-03-04 10:11:28,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985543904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:28,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:28,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-04 10:11:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993309405] [2025-03-04 10:11:28,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:28,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:11:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:28,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:11:28,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:11:28,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:28,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 982 flow. Second operand has 18 states, 18 states have (on average 13.11111111111111) internal successors, (236), 18 states have internal predecessors, (236), 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,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:28,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:28,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:29,583 INFO L124 PetriNetUnfolderBase]: 2162/3917 cut-off events. [2025-03-04 10:11:29,583 INFO L125 PetriNetUnfolderBase]: For 15045/15311 co-relation queries the response was YES. [2025-03-04 10:11:29,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16657 conditions, 3917 events. 2162/3917 cut-off events. For 15045/15311 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 22748 event pairs, 1291 based on Foata normal form. 77/3981 useless extension candidates. Maximal degree in co-relation 16590. Up to 2708 conditions per place. [2025-03-04 10:11:29,601 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 153 selfloop transitions, 31 changer transitions 0/190 dead transitions. [2025-03-04 10:11:29,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 190 transitions, 1853 flow [2025-03-04 10:11:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 263 transitions. [2025-03-04 10:11:29,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536734693877551 [2025-03-04 10:11:29,602 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 982 flow. Second operand 14 states and 263 transitions. [2025-03-04 10:11:29,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 190 transitions, 1853 flow [2025-03-04 10:11:29,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 190 transitions, 1692 flow, removed 24 selfloop flow, removed 13 redundant places. [2025-03-04 10:11:29,627 INFO L231 Difference]: Finished difference. Result has 129 places, 114 transitions, 1013 flow [2025-03-04 10:11:29,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1013, PETRI_PLACES=129, PETRI_TRANSITIONS=114} [2025-03-04 10:11:29,627 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 93 predicate places. [2025-03-04 10:11:29,627 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 114 transitions, 1013 flow [2025-03-04 10:11:29,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.11111111111111) internal successors, (236), 18 states have internal predecessors, (236), 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:29,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:29,628 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:29,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:29,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:29,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:29,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash 840476138, now seen corresponding path program 1 times [2025-03-04 10:11:29,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:29,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [814578214] [2025-03-04 10:11:29,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:29,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:29,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:29,832 INFO L229 MonitoredProcess]: Starting monitored process 19 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:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:11:29,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:29,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:29,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:29,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:29,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:29,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:29,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:29,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:29,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814578214] [2025-03-04 10:11:29,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814578214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:29,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:29,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:29,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791434764] [2025-03-04 10:11:29,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:29,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:29,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:29,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:29,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:29,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:29,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 114 transitions, 1013 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:29,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:29,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:29,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:30,339 INFO L124 PetriNetUnfolderBase]: 2154/3981 cut-off events. [2025-03-04 10:11:30,339 INFO L125 PetriNetUnfolderBase]: For 15751/15984 co-relation queries the response was YES. [2025-03-04 10:11:30,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17263 conditions, 3981 events. 2154/3981 cut-off events. For 15751/15984 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 24213 event pairs, 882 based on Foata normal form. 24/3979 useless extension candidates. Maximal degree in co-relation 17192. Up to 2016 conditions per place. [2025-03-04 10:11:30,362 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 150 selfloop transitions, 15 changer transitions 13/184 dead transitions. [2025-03-04 10:11:30,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 184 transitions, 1913 flow [2025-03-04 10:11:30,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-03-04 10:11:30,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-04 10:11:30,363 INFO L175 Difference]: Start difference. First operand has 129 places, 114 transitions, 1013 flow. Second operand 6 states and 117 transitions. [2025-03-04 10:11:30,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 184 transitions, 1913 flow [2025-03-04 10:11:30,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 184 transitions, 1826 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-04 10:11:30,400 INFO L231 Difference]: Finished difference. Result has 127 places, 114 transitions, 1000 flow [2025-03-04 10:11:30,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1000, PETRI_PLACES=127, PETRI_TRANSITIONS=114} [2025-03-04 10:11:30,401 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 91 predicate places. [2025-03-04 10:11:30,401 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 114 transitions, 1000 flow [2025-03-04 10:11:30,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:30,401 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:30,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:30,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:30,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:30,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1619195586, now seen corresponding path program 2 times [2025-03-04 10:11:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:30,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962661331] [2025-03-04 10:11:30,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:30,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:30,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:30,605 INFO L229 MonitoredProcess]: Starting monitored process 20 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:30,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:11:30,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:30,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:30,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:30,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:30,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:30,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:30,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:30,718 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:30,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962661331] [2025-03-04 10:11:30,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962661331] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:30,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:30,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:11:30,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933156755] [2025-03-04 10:11:30,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:30,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:30,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:30,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:30,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:30,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:30,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 114 transitions, 1000 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:30,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:30,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:30,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:31,181 INFO L124 PetriNetUnfolderBase]: 2724/4824 cut-off events. [2025-03-04 10:11:31,181 INFO L125 PetriNetUnfolderBase]: For 20745/20755 co-relation queries the response was YES. [2025-03-04 10:11:31,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21469 conditions, 4824 events. 2724/4824 cut-off events. For 20745/20755 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 28236 event pairs, 242 based on Foata normal form. 82/4906 useless extension candidates. Maximal degree in co-relation 21398. Up to 2252 conditions per place. [2025-03-04 10:11:31,211 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 169 selfloop transitions, 54 changer transitions 4/231 dead transitions. [2025-03-04 10:11:31,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 231 transitions, 2447 flow [2025-03-04 10:11:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-03-04 10:11:31,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2025-03-04 10:11:31,212 INFO L175 Difference]: Start difference. First operand has 127 places, 114 transitions, 1000 flow. Second operand 7 states and 128 transitions. [2025-03-04 10:11:31,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 231 transitions, 2447 flow [2025-03-04 10:11:31,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 231 transitions, 2353 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:31,331 INFO L231 Difference]: Finished difference. Result has 132 places, 152 transitions, 1502 flow [2025-03-04 10:11:31,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1502, PETRI_PLACES=132, PETRI_TRANSITIONS=152} [2025-03-04 10:11:31,332 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 96 predicate places. [2025-03-04 10:11:31,332 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 152 transitions, 1502 flow [2025-03-04 10:11:31,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:31,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:31,332 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:11:31,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:31,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:31,533 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:31,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:31,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2127193822, now seen corresponding path program 4 times [2025-03-04 10:11:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:31,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678394924] [2025-03-04 10:11:31,533 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:31,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:31,536 INFO L229 MonitoredProcess]: Starting monitored process 21 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:31,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:11:31,571 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:31,600 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:31,600 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:31,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:31,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:11:31,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:31,614 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 7 [2025-03-04 10:11:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:31,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:32,958 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:32,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678394924] [2025-03-04 10:11:32,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678394924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:32,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:32,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2025-03-04 10:11:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348637963] [2025-03-04 10:11:32,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:32,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:11:32,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:32,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:11:32,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:11:34,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:34,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 152 transitions, 1502 flow. Second operand has 21 states, 21 states have (on average 11.619047619047619) internal successors, (244), 21 states have internal predecessors, (244), 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:34,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:34,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:34,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:38,416 INFO L124 PetriNetUnfolderBase]: 3894/7203 cut-off events. [2025-03-04 10:11:38,416 INFO L125 PetriNetUnfolderBase]: For 46322/46810 co-relation queries the response was YES. [2025-03-04 10:11:38,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34980 conditions, 7203 events. 3894/7203 cut-off events. For 46322/46810 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 46714 event pairs, 877 based on Foata normal form. 147/7332 useless extension candidates. Maximal degree in co-relation 34906. Up to 1515 conditions per place. [2025-03-04 10:11:38,459 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 348 selfloop transitions, 108 changer transitions 0/469 dead transitions. [2025-03-04 10:11:38,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 469 transitions, 5208 flow [2025-03-04 10:11:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:11:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:11:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 483 transitions. [2025-03-04 10:11:38,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5307692307692308 [2025-03-04 10:11:38,461 INFO L175 Difference]: Start difference. First operand has 132 places, 152 transitions, 1502 flow. Second operand 26 states and 483 transitions. [2025-03-04 10:11:38,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 469 transitions, 5208 flow [2025-03-04 10:11:38,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 469 transitions, 5134 flow, removed 37 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:38,567 INFO L231 Difference]: Finished difference. Result has 166 places, 197 transitions, 2392 flow [2025-03-04 10:11:38,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2392, PETRI_PLACES=166, PETRI_TRANSITIONS=197} [2025-03-04 10:11:38,568 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 130 predicate places. [2025-03-04 10:11:38,568 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 197 transitions, 2392 flow [2025-03-04 10:11:38,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.619047619047619) internal successors, (244), 21 states have internal predecessors, (244), 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:38,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:38,569 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:38,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:11:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:38,769 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2144344766, now seen corresponding path program 1 times [2025-03-04 10:11:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530493824] [2025-03-04 10:11:38,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:38,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:38,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:38,772 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:11:38,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:11:38,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:38,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:38,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:38,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:38,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:38,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:38,887 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:38,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530493824] [2025-03-04 10:11:38,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530493824] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:38,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:38,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:11:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96753659] [2025-03-04 10:11:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:38,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:38,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:38,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:38,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:38,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 197 transitions, 2392 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:38,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:38,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:38,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:39,922 INFO L124 PetriNetUnfolderBase]: 5097/8682 cut-off events. [2025-03-04 10:11:39,923 INFO L125 PetriNetUnfolderBase]: For 62165/62317 co-relation queries the response was YES. [2025-03-04 10:11:39,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44975 conditions, 8682 events. 5097/8682 cut-off events. For 62165/62317 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 51840 event pairs, 563 based on Foata normal form. 139/8821 useless extension candidates. Maximal degree in co-relation 44889. Up to 4191 conditions per place. [2025-03-04 10:11:40,003 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 270 selfloop transitions, 79 changer transitions 0/354 dead transitions. [2025-03-04 10:11:40,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 354 transitions, 4881 flow [2025-03-04 10:11:40,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2025-03-04 10:11:40,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-03-04 10:11:40,005 INFO L175 Difference]: Start difference. First operand has 166 places, 197 transitions, 2392 flow. Second operand 7 states and 131 transitions. [2025-03-04 10:11:40,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 354 transitions, 4881 flow [2025-03-04 10:11:40,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 354 transitions, 4749 flow, removed 55 selfloop flow, removed 8 redundant places. [2025-03-04 10:11:40,217 INFO L231 Difference]: Finished difference. Result has 168 places, 240 transitions, 3088 flow [2025-03-04 10:11:40,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3088, PETRI_PLACES=168, PETRI_TRANSITIONS=240} [2025-03-04 10:11:40,218 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 132 predicate places. [2025-03-04 10:11:40,218 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 240 transitions, 3088 flow [2025-03-04 10:11:40,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:40,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:40,218 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:40,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 10:11:40,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:40,419 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:40,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash -895767944, now seen corresponding path program 3 times [2025-03-04 10:11:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804346843] [2025-03-04 10:11:40,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:40,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:40,421 INFO L229 MonitoredProcess]: Starting monitored process 23 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:40,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:11:40,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:40,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:40,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:40,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:40,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:40,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:40,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:40,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804346843] [2025-03-04 10:11:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804346843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250760315] [2025-03-04 10:11:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:40,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:40,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:40,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 240 transitions, 3088 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:40,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:40,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:40,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:41,647 INFO L124 PetriNetUnfolderBase]: 5055/8895 cut-off events. [2025-03-04 10:11:41,647 INFO L125 PetriNetUnfolderBase]: For 76644/76795 co-relation queries the response was YES. [2025-03-04 10:11:41,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48688 conditions, 8895 events. 5055/8895 cut-off events. For 76644/76795 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 55708 event pairs, 1879 based on Foata normal form. 18/8912 useless extension candidates. Maximal degree in co-relation 48599. Up to 5385 conditions per place. [2025-03-04 10:11:41,712 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 270 selfloop transitions, 77 changer transitions 13/377 dead transitions. [2025-03-04 10:11:41,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 377 transitions, 5576 flow [2025-03-04 10:11:41,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-03-04 10:11:41,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-04 10:11:41,713 INFO L175 Difference]: Start difference. First operand has 168 places, 240 transitions, 3088 flow. Second operand 6 states and 117 transitions. [2025-03-04 10:11:41,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 377 transitions, 5576 flow [2025-03-04 10:11:41,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 377 transitions, 5558 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:41,925 INFO L231 Difference]: Finished difference. Result has 176 places, 285 transitions, 4096 flow [2025-03-04 10:11:41,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3070, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4096, PETRI_PLACES=176, PETRI_TRANSITIONS=285} [2025-03-04 10:11:41,925 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 140 predicate places. [2025-03-04 10:11:41,925 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 285 transitions, 4096 flow [2025-03-04 10:11:41,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:41,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:41,925 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:41,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:11:42,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:42,126 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:42,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1103095070, now seen corresponding path program 2 times [2025-03-04 10:11:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:42,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842477918] [2025-03-04 10:11:42,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:42,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:42,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:42,128 INFO L229 MonitoredProcess]: Starting monitored process 24 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:42,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:11:42,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:42,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-04 10:11:42,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:42,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:42,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:42,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:42,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:42,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842477918] [2025-03-04 10:11:42,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842477918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:42,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:42,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:42,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371599193] [2025-03-04 10:11:42,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:42,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:42,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:42,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:42,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:42,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:42,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 285 transitions, 4096 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:42,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:42,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:42,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:43,380 INFO L124 PetriNetUnfolderBase]: 4711/8443 cut-off events. [2025-03-04 10:11:43,380 INFO L125 PetriNetUnfolderBase]: For 80727/81011 co-relation queries the response was YES. [2025-03-04 10:11:43,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48308 conditions, 8443 events. 4711/8443 cut-off events. For 80727/81011 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 53718 event pairs, 1825 based on Foata normal form. 10/8450 useless extension candidates. Maximal degree in co-relation 48214. Up to 5219 conditions per place. [2025-03-04 10:11:43,458 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 239 selfloop transitions, 105 changer transitions 13/371 dead transitions. [2025-03-04 10:11:43,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 371 transitions, 5872 flow [2025-03-04 10:11:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-03-04 10:11:43,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-04 10:11:43,463 INFO L175 Difference]: Start difference. First operand has 176 places, 285 transitions, 4096 flow. Second operand 6 states and 117 transitions. [2025-03-04 10:11:43,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 371 transitions, 5872 flow [2025-03-04 10:11:43,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 371 transitions, 5795 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:43,693 INFO L231 Difference]: Finished difference. Result has 181 places, 309 transitions, 4800 flow [2025-03-04 10:11:43,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4035, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4800, PETRI_PLACES=181, PETRI_TRANSITIONS=309} [2025-03-04 10:11:43,693 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 145 predicate places. [2025-03-04 10:11:43,693 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 309 transitions, 4800 flow [2025-03-04 10:11:43,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:43,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:43,693 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:43,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:43,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:43,894 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash 801146498, now seen corresponding path program 3 times [2025-03-04 10:11:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:43,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935412180] [2025-03-04 10:11:43,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:43,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:43,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:43,897 INFO L229 MonitoredProcess]: Starting monitored process 25 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:43,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:11:43,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:43,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:43,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:43,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:43,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:43,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:43,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:43,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:43,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935412180] [2025-03-04 10:11:43,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935412180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:43,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:43,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:43,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61416410] [2025-03-04 10:11:43,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:43,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:43,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:43,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:44,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:44,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 309 transitions, 4800 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:44,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:44,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:44,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:45,323 INFO L124 PetriNetUnfolderBase]: 4669/8427 cut-off events. [2025-03-04 10:11:45,324 INFO L125 PetriNetUnfolderBase]: For 91345/91571 co-relation queries the response was YES. [2025-03-04 10:11:45,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48698 conditions, 8427 events. 4669/8427 cut-off events. For 91345/91571 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 54081 event pairs, 1593 based on Foata normal form. 10/8433 useless extension candidates. Maximal degree in co-relation 48602. Up to 4674 conditions per place. [2025-03-04 10:11:45,402 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 336 selfloop transitions, 61 changer transitions 6/417 dead transitions. [2025-03-04 10:11:45,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 417 transitions, 6943 flow [2025-03-04 10:11:45,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-03-04 10:11:45,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 10:11:45,403 INFO L175 Difference]: Start difference. First operand has 181 places, 309 transitions, 4800 flow. Second operand 6 states and 112 transitions. [2025-03-04 10:11:45,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 417 transitions, 6943 flow [2025-03-04 10:11:45,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 417 transitions, 6763 flow, removed 30 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:45,663 INFO L231 Difference]: Finished difference. Result has 184 places, 309 transitions, 4780 flow [2025-03-04 10:11:45,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4632, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4780, PETRI_PLACES=184, PETRI_TRANSITIONS=309} [2025-03-04 10:11:45,663 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 148 predicate places. [2025-03-04 10:11:45,663 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 309 transitions, 4780 flow [2025-03-04 10:11:45,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:45,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:45,664 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:45,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:45,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:45,864 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:45,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1779520076, now seen corresponding path program 4 times [2025-03-04 10:11:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437941967] [2025-03-04 10:11:45,865 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:45,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:45,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:45,867 INFO L229 MonitoredProcess]: Starting monitored process 26 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:45,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:11:45,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:45,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-04 10:11:45,909 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:45,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:45,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:45,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:45,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:45,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437941967] [2025-03-04 10:11:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437941967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131178621] [2025-03-04 10:11:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:45,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:45,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:45,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:45,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:45,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:45,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 309 transitions, 4780 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:45,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:45,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:47,049 INFO L124 PetriNetUnfolderBase]: 4766/8592 cut-off events. [2025-03-04 10:11:47,049 INFO L125 PetriNetUnfolderBase]: For 98758/98846 co-relation queries the response was YES. [2025-03-04 10:11:47,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50468 conditions, 8592 events. 4766/8592 cut-off events. For 98758/98846 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 55189 event pairs, 1746 based on Foata normal form. 15/8581 useless extension candidates. Maximal degree in co-relation 50372. Up to 5133 conditions per place. [2025-03-04 10:11:47,116 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 238 selfloop transitions, 102 changer transitions 8/365 dead transitions. [2025-03-04 10:11:47,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 365 transitions, 5965 flow [2025-03-04 10:11:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-04 10:11:47,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2025-03-04 10:11:47,117 INFO L175 Difference]: Start difference. First operand has 184 places, 309 transitions, 4780 flow. Second operand 5 states and 107 transitions. [2025-03-04 10:11:47,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 365 transitions, 5965 flow [2025-03-04 10:11:47,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 365 transitions, 5846 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:47,382 INFO L231 Difference]: Finished difference. Result has 184 places, 307 transitions, 4834 flow [2025-03-04 10:11:47,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4670, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4834, PETRI_PLACES=184, PETRI_TRANSITIONS=307} [2025-03-04 10:11:47,383 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 148 predicate places. [2025-03-04 10:11:47,383 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 307 transitions, 4834 flow [2025-03-04 10:11:47,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:47,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:47,383 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:47,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:47,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:47,584 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:47,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1381339094, now seen corresponding path program 4 times [2025-03-04 10:11:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [897216436] [2025-03-04 10:11:47,584 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:47,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:47,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:47,586 INFO L229 MonitoredProcess]: Starting monitored process 27 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:47,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:11:47,620 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:47,626 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-04 10:11:47,627 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:47,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:47,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:47,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:47,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:47,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:47,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897216436] [2025-03-04 10:11:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897216436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728437887] [2025-03-04 10:11:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:47,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:47,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:47,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:47,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:47,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 307 transitions, 4834 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:47,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:47,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:47,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:49,065 INFO L124 PetriNetUnfolderBase]: 6122/10351 cut-off events. [2025-03-04 10:11:49,065 INFO L125 PetriNetUnfolderBase]: For 117151/117232 co-relation queries the response was YES. [2025-03-04 10:11:49,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60534 conditions, 10351 events. 6122/10351 cut-off events. For 117151/117232 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 63435 event pairs, 1887 based on Foata normal form. 149/10500 useless extension candidates. Maximal degree in co-relation 60439. Up to 6111 conditions per place. [2025-03-04 10:11:49,152 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 310 selfloop transitions, 99 changer transitions 0/414 dead transitions. [2025-03-04 10:11:49,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 414 transitions, 6731 flow [2025-03-04 10:11:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-04 10:11:49,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:11:49,153 INFO L175 Difference]: Start difference. First operand has 184 places, 307 transitions, 4834 flow. Second operand 6 states and 126 transitions. [2025-03-04 10:11:49,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 414 transitions, 6731 flow [2025-03-04 10:11:49,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 414 transitions, 6605 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:49,420 INFO L231 Difference]: Finished difference. Result has 186 places, 304 transitions, 4873 flow [2025-03-04 10:11:49,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4409, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4873, PETRI_PLACES=186, PETRI_TRANSITIONS=304} [2025-03-04 10:11:49,421 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 150 predicate places. [2025-03-04 10:11:49,421 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 304 transitions, 4873 flow [2025-03-04 10:11:49,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:49,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:49,421 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:49,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 10:11:49,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:49,622 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:49,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash -374344146, now seen corresponding path program 5 times [2025-03-04 10:11:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:49,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829337523] [2025-03-04 10:11:49,622 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:49,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:49,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:49,624 INFO L229 MonitoredProcess]: Starting monitored process 28 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:49,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:11:49,659 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:49,672 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:49,673 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:49,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:49,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:49,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:49,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:49,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829337523] [2025-03-04 10:11:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829337523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069412029] [2025-03-04 10:11:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:49,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:49,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:49,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:49,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:49,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:11:49,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 304 transitions, 4873 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:49,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:49,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:11:49,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:50,990 INFO L124 PetriNetUnfolderBase]: 5245/9292 cut-off events. [2025-03-04 10:11:50,990 INFO L125 PetriNetUnfolderBase]: For 108680/109324 co-relation queries the response was YES. [2025-03-04 10:11:51,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54790 conditions, 9292 events. 5245/9292 cut-off events. For 108680/109324 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 60141 event pairs, 1934 based on Foata normal form. 10/9296 useless extension candidates. Maximal degree in co-relation 54694. Up to 5102 conditions per place. [2025-03-04 10:11:51,066 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 275 selfloop transitions, 93 changer transitions 3/387 dead transitions. [2025-03-04 10:11:51,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 387 transitions, 6526 flow [2025-03-04 10:11:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-04 10:11:51,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-04 10:11:51,180 INFO L175 Difference]: Start difference. First operand has 186 places, 304 transitions, 4873 flow. Second operand 6 states and 115 transitions. [2025-03-04 10:11:51,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 387 transitions, 6526 flow [2025-03-04 10:11:51,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 387 transitions, 6330 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:51,520 INFO L231 Difference]: Finished difference. Result has 189 places, 306 transitions, 4923 flow [2025-03-04 10:11:51,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4687, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4923, PETRI_PLACES=189, PETRI_TRANSITIONS=306} [2025-03-04 10:11:51,527 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 153 predicate places. [2025-03-04 10:11:51,527 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 306 transitions, 4923 flow [2025-03-04 10:11:51,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:51,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:51,528 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:51,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:11:51,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:51,729 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:51,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1180790462, now seen corresponding path program 6 times [2025-03-04 10:11:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206586153] [2025-03-04 10:11:51,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:51,731 INFO L229 MonitoredProcess]: Starting monitored process 29 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:51,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:11:51,772 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:51,785 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:51,785 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:11:51,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:51,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:51,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:51,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:51,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206586153] [2025-03-04 10:11:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206586153] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:51,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:11:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096497702] [2025-03-04 10:11:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:51,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:51,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:51,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:51,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:51,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:51,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 306 transitions, 4923 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:51,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:51,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:51,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:53,304 INFO L124 PetriNetUnfolderBase]: 5883/9995 cut-off events. [2025-03-04 10:11:53,304 INFO L125 PetriNetUnfolderBase]: For 117631/117689 co-relation queries the response was YES. [2025-03-04 10:11:53,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58529 conditions, 9995 events. 5883/9995 cut-off events. For 117631/117689 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 60891 event pairs, 1388 based on Foata normal form. 139/10134 useless extension candidates. Maximal degree in co-relation 58431. Up to 6131 conditions per place. [2025-03-04 10:11:53,369 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 305 selfloop transitions, 83 changer transitions 3/396 dead transitions. [2025-03-04 10:11:53,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 396 transitions, 6754 flow [2025-03-04 10:11:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-04 10:11:53,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-03-04 10:11:53,370 INFO L175 Difference]: Start difference. First operand has 189 places, 306 transitions, 4923 flow. Second operand 5 states and 96 transitions. [2025-03-04 10:11:53,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 396 transitions, 6754 flow [2025-03-04 10:11:53,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 396 transitions, 6613 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:53,668 INFO L231 Difference]: Finished difference. Result has 189 places, 295 transitions, 4736 flow [2025-03-04 10:11:53,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4577, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4736, PETRI_PLACES=189, PETRI_TRANSITIONS=295} [2025-03-04 10:11:53,669 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 153 predicate places. [2025-03-04 10:11:53,669 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 295 transitions, 4736 flow [2025-03-04 10:11:53,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:53,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:53,669 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:53,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 10:11:53,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:53,870 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:53,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2079513918, now seen corresponding path program 5 times [2025-03-04 10:11:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266680655] [2025-03-04 10:11:53,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:53,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:53,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:53,873 INFO L229 MonitoredProcess]: Starting monitored process 30 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:53,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:11:53,906 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:11:53,917 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:11:53,917 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:53,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:53,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:53,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:53,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:53,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266680655] [2025-03-04 10:11:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266680655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:53,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:53,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061948169] [2025-03-04 10:11:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:53,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:53,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:53,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:53,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:53,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 295 transitions, 4736 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:53,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:53,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:53,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:55,322 INFO L124 PetriNetUnfolderBase]: 6297/10558 cut-off events. [2025-03-04 10:11:55,322 INFO L125 PetriNetUnfolderBase]: For 123035/123107 co-relation queries the response was YES. [2025-03-04 10:11:55,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63416 conditions, 10558 events. 6297/10558 cut-off events. For 123035/123107 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 63912 event pairs, 2251 based on Foata normal form. 10/10568 useless extension candidates. Maximal degree in co-relation 63319. Up to 5455 conditions per place. [2025-03-04 10:11:55,400 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 314 selfloop transitions, 86 changer transitions 0/405 dead transitions. [2025-03-04 10:11:55,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 405 transitions, 6727 flow [2025-03-04 10:11:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2025-03-04 10:11:55,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-03-04 10:11:55,401 INFO L175 Difference]: Start difference. First operand has 189 places, 295 transitions, 4736 flow. Second operand 7 states and 131 transitions. [2025-03-04 10:11:55,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 405 transitions, 6727 flow [2025-03-04 10:11:55,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 405 transitions, 6338 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-03-04 10:11:55,851 INFO L231 Difference]: Finished difference. Result has 186 places, 299 transitions, 4693 flow [2025-03-04 10:11:55,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4262, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4693, PETRI_PLACES=186, PETRI_TRANSITIONS=299} [2025-03-04 10:11:55,852 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 150 predicate places. [2025-03-04 10:11:55,852 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 299 transitions, 4693 flow [2025-03-04 10:11:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:55,852 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:55,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-04 10:11:56,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:56,053 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:56,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:56,053 INFO L85 PathProgramCache]: Analyzing trace with hash 604937172, now seen corresponding path program 4 times [2025-03-04 10:11:56,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:11:56,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935146994] [2025-03-04 10:11:56,053 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:56,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:56,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:56,055 INFO L229 MonitoredProcess]: Starting monitored process 31 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,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:11:56,090 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:56,116 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:56,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:56,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:56,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:11:56,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:56,130 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 7 [2025-03-04 10:11:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:56,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:57,295 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:11:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935146994] [2025-03-04 10:11:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935146994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:57,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2025-03-04 10:11:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121711277] [2025-03-04 10:11:57,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:57,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:11:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:11:57,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:11:57,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:11:58,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:11:58,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 299 transitions, 4693 flow. Second operand has 21 states, 21 states have (on average 11.80952380952381) internal successors, (248), 21 states have internal predecessors, (248), 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:58,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:58,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:11:58,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:03,083 INFO L124 PetriNetUnfolderBase]: 6576/11644 cut-off events. [2025-03-04 10:12:03,083 INFO L125 PetriNetUnfolderBase]: For 131621/132971 co-relation queries the response was YES. [2025-03-04 10:12:03,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65935 conditions, 11644 events. 6576/11644 cut-off events. For 131621/132971 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 76060 event pairs, 963 based on Foata normal form. 260/11777 useless extension candidates. Maximal degree in co-relation 65840. Up to 2685 conditions per place. [2025-03-04 10:12:03,161 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 538 selfloop transitions, 136 changer transitions 0/705 dead transitions. [2025-03-04 10:12:03,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 705 transitions, 11280 flow [2025-03-04 10:12:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:12:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:12:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 467 transitions. [2025-03-04 10:12:03,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5131868131868131 [2025-03-04 10:12:03,163 INFO L175 Difference]: Start difference. First operand has 186 places, 299 transitions, 4693 flow. Second operand 26 states and 467 transitions. [2025-03-04 10:12:03,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 705 transitions, 11280 flow [2025-03-04 10:12:03,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 705 transitions, 10980 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-04 10:12:03,415 INFO L231 Difference]: Finished difference. Result has 214 places, 353 transitions, 5623 flow [2025-03-04 10:12:03,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4495, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5623, PETRI_PLACES=214, PETRI_TRANSITIONS=353} [2025-03-04 10:12:03,416 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 178 predicate places. [2025-03-04 10:12:03,416 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 353 transitions, 5623 flow [2025-03-04 10:12:03,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.80952380952381) internal successors, (248), 21 states have internal predecessors, (248), 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:03,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:03,416 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:03,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 10:12:03,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:03,617 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:12:03,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:03,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1869186377, now seen corresponding path program 5 times [2025-03-04 10:12:03,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:12:03,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485470991] [2025-03-04 10:12:03,617 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:12:03,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:03,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:03,619 INFO L229 MonitoredProcess]: Starting monitored process 32 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:12:03,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:12:03,654 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 7 equivalence classes. [2025-03-04 10:12:03,724 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:12:03,724 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 10:12:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:03,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:12:03,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:03,739 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 7 [2025-03-04 10:12:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 10:12:03,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 10:12:04,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:12:04,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485470991] [2025-03-04 10:12:04,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485470991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:04,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:12:04,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-03-04 10:12:04,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484790466] [2025-03-04 10:12:04,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:04,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:12:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:12:04,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:12:04,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:12:04,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-04 10:12:04,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 353 transitions, 5623 flow. Second operand has 14 states, 14 states have (on average 11.857142857142858) internal successors, (166), 14 states have internal predecessors, (166), 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:04,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:04,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-04 10:12:04,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:07,106 INFO L124 PetriNetUnfolderBase]: 6776/11884 cut-off events. [2025-03-04 10:12:07,106 INFO L125 PetriNetUnfolderBase]: For 161682/163271 co-relation queries the response was YES. [2025-03-04 10:12:07,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72171 conditions, 11884 events. 6776/11884 cut-off events. For 161682/163271 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 77911 event pairs, 1444 based on Foata normal form. 82/11866 useless extension candidates. Maximal degree in co-relation 72066. Up to 3362 conditions per place. [2025-03-04 10:12:07,241 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 353 selfloop transitions, 136 changer transitions 0/520 dead transitions. [2025-03-04 10:12:07,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 520 transitions, 8771 flow [2025-03-04 10:12:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:12:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:12:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-03-04 10:12:07,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064935064935064 [2025-03-04 10:12:07,243 INFO L175 Difference]: Start difference. First operand has 214 places, 353 transitions, 5623 flow. Second operand 11 states and 195 transitions. [2025-03-04 10:12:07,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 520 transitions, 8771 flow [2025-03-04 10:12:07,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 520 transitions, 8528 flow, removed 93 selfloop flow, removed 11 redundant places. [2025-03-04 10:12:07,765 INFO L231 Difference]: Finished difference. Result has 215 places, 358 transitions, 5978 flow [2025-03-04 10:12:07,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5490, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5978, PETRI_PLACES=215, PETRI_TRANSITIONS=358} [2025-03-04 10:12:07,766 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 179 predicate places. [2025-03-04 10:12:07,766 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 358 transitions, 5978 flow [2025-03-04 10:12:07,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.857142857142858) internal successors, (166), 14 states have internal predecessors, (166), 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:07,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:07,766 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2025-03-04 10:12:07,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 10:12:07,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:07,967 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:12:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash 254969201, now seen corresponding path program 3 times [2025-03-04 10:12:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:12:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318707121] [2025-03-04 10:12:07,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:12:07,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:07,969 INFO L229 MonitoredProcess]: Starting monitored process 33 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:12:07,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:12:08,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 11 equivalence classes. [2025-03-04 10:12:08,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:12:08,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:12:08,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:08,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:12:08,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:08,197 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 7 [2025-03-04 10:12:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:08,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:09,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:12:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318707121] [2025-03-04 10:12:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318707121] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:09,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:12:09,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2025-03-04 10:12:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023045372] [2025-03-04 10:12:09,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:09,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:12:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:12:09,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:12:09,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:12:11,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 10:12:11,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 358 transitions, 5978 flow. Second operand has 26 states, 26 states have (on average 12.76923076923077) internal successors, (332), 26 states have internal predecessors, (332), 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:11,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:11,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 10:12:11,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:23,963 INFO L124 PetriNetUnfolderBase]: 6488/11722 cut-off events. [2025-03-04 10:12:23,963 INFO L125 PetriNetUnfolderBase]: For 161852/162484 co-relation queries the response was YES. [2025-03-04 10:12:24,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72485 conditions, 11722 events. 6488/11722 cut-off events. For 161852/162484 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 78320 event pairs, 3638 based on Foata normal form. 18/11619 useless extension candidates. Maximal degree in co-relation 72103. Up to 9419 conditions per place. [2025-03-04 10:12:24,088 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 295 selfloop transitions, 66 changer transitions 0/394 dead transitions. [2025-03-04 10:12:24,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 394 transitions, 7192 flow [2025-03-04 10:12:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:12:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 10:12:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 605 transitions. [2025-03-04 10:12:24,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37577639751552794 [2025-03-04 10:12:24,089 INFO L175 Difference]: Start difference. First operand has 215 places, 358 transitions, 5978 flow. Second operand 46 states and 605 transitions. [2025-03-04 10:12:24,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 394 transitions, 7192 flow [2025-03-04 10:12:24,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 394 transitions, 7147 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 10:12:24,588 INFO L231 Difference]: Finished difference. Result has 268 places, 394 transitions, 6611 flow [2025-03-04 10:12:24,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5945, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=6611, PETRI_PLACES=268, PETRI_TRANSITIONS=394} [2025-03-04 10:12:24,589 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 232 predicate places. [2025-03-04 10:12:24,589 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 394 transitions, 6611 flow [2025-03-04 10:12:24,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.76923076923077) internal successors, (332), 26 states have internal predecessors, (332), 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:24,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:24,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:24,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-04 10:12:24,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:24,790 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:12:24,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1049329049, now seen corresponding path program 1 times [2025-03-04 10:12:24,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:12:24,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312822380] [2025-03-04 10:12:24,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:24,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:24,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:24,792 INFO L229 MonitoredProcess]: Starting monitored process 34 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:12:24,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:12:24,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:12:24,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:12:24,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:24,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:12:24,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:12:24,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:12:24,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:12:24,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:12:24,895 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 10:12:24,895 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:12:24,895 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-04 10:12:24,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-03-04 10:12:24,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-04 10:12:25,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:25,099 INFO L422 BasicCegarLoop]: Path program histogram: [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:25,131 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:12:25,131 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:12:25,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:12:25 BasicIcfg [2025-03-04 10:12:25,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:12:25,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:12:25,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:12:25,135 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:12:25,135 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:08" (3/4) ... [2025-03-04 10:12:25,136 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:12:25,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:12:25,137 INFO L158 Benchmark]: Toolchain (without parser) took 77740.91ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 92.4MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 582.9MB. Max. memory is 16.1GB. [2025-03-04 10:12:25,137 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:12:25,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.60ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 79.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:12:25,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.78ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:12:25,138 INFO L158 Benchmark]: Boogie Preprocessor took 37.79ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:12:25,138 INFO L158 Benchmark]: IcfgBuilder took 653.21ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 78.5MB in the end (delta: -2.4MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2025-03-04 10:12:25,138 INFO L158 Benchmark]: TraceAbstraction took 76832.33ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 77.8MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 570.1MB. Max. memory is 16.1GB. [2025-03-04 10:12:25,138 INFO L158 Benchmark]: Witness Printer took 2.27ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 196.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:12:25,139 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.60ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 79.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.78ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.79ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 653.21ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 78.5MB in the end (delta: -2.4MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * TraceAbstraction took 76832.33ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 77.8MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 570.1MB. Max. memory is 16.1GB. * Witness Printer took 2.27ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 196.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={2048:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={2048:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={2048:0}, N=1, counter=0, t1=-1] [L48] 1 int i=0; VAL [A={2048:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={2048:0}, N=1, counter=0, t1=-1, t2=0] [L57] 2 int i=0; VAL [A={2048:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L50] 1 counter = tmp VAL [A={2048:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=1, i=0, tmp=1] [L48] 1 i++ VAL [A={2048:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=1, i=1] [L48] COND FALSE 1 !(i