./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-5.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/unroll-cond-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:04,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:04,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:18:04,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:04,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:04,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:04,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:04,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:04,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:04,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:04,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:04,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:04,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:04,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:04,487 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:04,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:04,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:04,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:04,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:04,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:04,488 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:04,488 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:04,488 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:04,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:04,489 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:04,489 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:04,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:04,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:04,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:04,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:04,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:04,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:04,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:04,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:04,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:04,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:04,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:18:04,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:18:04,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:04,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:04,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:04,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:04,490 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 -> 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 [2025-03-04 10:18:04,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:04,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:04,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:04,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:04,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:04,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-03-04 10:18:05,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55440a09/60e18e5c638c4ca1b119836c6b6d13a3/FLAG887113177 [2025-03-04 10:18:06,092 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:06,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-03-04 10:18:06,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55440a09/60e18e5c638c4ca1b119836c6b6d13a3/FLAG887113177 [2025-03-04 10:18:06,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55440a09/60e18e5c638c4ca1b119836c6b6d13a3 [2025-03-04 10:18:06,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:06,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:06,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:06,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:06,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:06,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9bbfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06, skipping insertion in model container [2025-03-04 10:18:06,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:06,549 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:18:06,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:06,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:06,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:06,597 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:06,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06 WrapperNode [2025-03-04 10:18:06,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:06,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:06,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:06,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:06,604 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:18:06" (1/1) ... [2025-03-04 10:18:06,609 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:18:06" (1/1) ... [2025-03-04 10:18:06,622 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 190 [2025-03-04 10:18:06,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:06,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:06,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:06,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:06,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,642 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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:18:06,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:06,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:06,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:06,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:06,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (1/1) ... [2025-03-04 10:18:06,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:06,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:06,690 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:18:06,692 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:18:06,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:18:06,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:18:06,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:18:06,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:18:06,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:18:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:18:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:18:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:18:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:18:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:18:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:06,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:18:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:18:06,713 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:18:06,795 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:06,796 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:07,184 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:07,184 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:07,407 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:07,407 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:07,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:07 BoogieIcfgContainer [2025-03-04 10:18:07,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:07,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:07,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:07,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:07,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:06" (1/3) ... [2025-03-04 10:18:07,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722c3e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:07, skipping insertion in model container [2025-03-04 10:18:07,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:06" (2/3) ... [2025-03-04 10:18:07,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722c3e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:07, skipping insertion in model container [2025-03-04 10:18:07,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:07" (3/3) ... [2025-03-04 10:18:07,416 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2025-03-04 10:18:07,428 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:07,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-5.wvr.c that has 3 procedures, 58 locations, 1 initial locations, 3 loop locations, and 24 error locations. [2025-03-04 10:18:07,430 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:07,484 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:07,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 142 flow [2025-03-04 10:18:07,532 INFO L124 PetriNetUnfolderBase]: 7/62 cut-off events. [2025-03-04 10:18:07,536 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:07,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 7/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-03-04 10:18:07,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 64 transitions, 142 flow [2025-03-04 10:18:07,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 61 transitions, 134 flow [2025-03-04 10:18:07,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:07,560 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;@546b5517, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:07,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-04 10:18:07,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:07,563 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:18:07,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:18:07,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:07,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:18:07,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:07,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 578080, now seen corresponding path program 1 times [2025-03-04 10:18:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:07,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171791715] [2025-03-04 10:18:07,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:07,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:18:07,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:18:07,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:07,774 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:18:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:07,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171791715] [2025-03-04 10:18:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171791715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:07,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:07,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:07,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351294474] [2025-03-04 10:18:07,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:07,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:07,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:07,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:07,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-03-04 10:18:07,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:07,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:07,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-03-04 10:18:07,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:07,999 INFO L124 PetriNetUnfolderBase]: 205/526 cut-off events. [2025-03-04 10:18:07,999 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 10:18:08,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 526 events. 205/526 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3137 event pairs, 130 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 772. Up to 325 conditions per place. [2025-03-04 10:18:08,005 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 29 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-03-04 10:18:08,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 190 flow [2025-03-04 10:18:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-04 10:18:08,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-03-04 10:18:08,020 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 134 flow. Second operand 3 states and 123 transitions. [2025-03-04 10:18:08,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 190 flow [2025-03-04 10:18:08,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:08,028 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 124 flow [2025-03-04 10:18:08,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2025-03-04 10:18:08,032 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2025-03-04 10:18:08,033 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 124 flow [2025-03-04 10:18:08,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:08,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:08,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:18:08,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:18:08,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:08,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash 578081, now seen corresponding path program 1 times [2025-03-04 10:18:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:08,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924011165] [2025-03-04 10:18:08,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:08,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:18:08,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:18:08,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:08,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,296 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:18:08,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924011165] [2025-03-04 10:18:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924011165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:08,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:08,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049726921] [2025-03-04 10:18:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:08,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:08,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:08,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:08,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-03-04 10:18:08,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:08,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:08,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-03-04 10:18:08,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:08,468 INFO L124 PetriNetUnfolderBase]: 206/529 cut-off events. [2025-03-04 10:18:08,468 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:18:08,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 529 events. 206/529 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3151 event pairs, 130 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 849. Up to 330 conditions per place. [2025-03-04 10:18:08,474 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 32 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-04 10:18:08,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 202 flow [2025-03-04 10:18:08,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-04 10:18:08,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-04 10:18:08,476 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 124 flow. Second operand 3 states and 126 transitions. [2025-03-04 10:18:08,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 202 flow [2025-03-04 10:18:08,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:08,478 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 139 flow [2025-03-04 10:18:08,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2025-03-04 10:18:08,478 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2025-03-04 10:18:08,478 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 139 flow [2025-03-04 10:18:08,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:18:08,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:08,480 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:18:08,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:18:08,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:08,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 555553659, now seen corresponding path program 1 times [2025-03-04 10:18:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471920754] [2025-03-04 10:18:08,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:08,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:18:08,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:18:08,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:08,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,752 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:18:08,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:08,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471920754] [2025-03-04 10:18:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471920754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:08,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82255732] [2025-03-04 10:18:08,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:08,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:08,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:08,756 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:18:08,757 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:18:08,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:18:08,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:18:08,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:08,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:18:08,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:08,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:18:09,016 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:18:09,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:09,103 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:18:09,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82255732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:09,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:09,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131239154] [2025-03-04 10:18:09,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:09,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:09,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:09,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:09,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-03-04 10:18:09,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 139 flow. Second operand has 11 states, 11 states have (on average 31.363636363636363) internal successors, (345), 11 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:18:09,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:09,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-03-04 10:18:09,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:09,550 INFO L124 PetriNetUnfolderBase]: 207/531 cut-off events. [2025-03-04 10:18:09,551 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:18:09,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 531 events. 207/531 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3163 event pairs, 130 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 849. Up to 327 conditions per place. [2025-03-04 10:18:09,554 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 28 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2025-03-04 10:18:09,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 221 flow [2025-03-04 10:18:09,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 249 transitions. [2025-03-04 10:18:09,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5558035714285714 [2025-03-04 10:18:09,556 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 139 flow. Second operand 7 states and 249 transitions. [2025-03-04 10:18:09,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 221 flow [2025-03-04 10:18:09,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:09,558 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 164 flow [2025-03-04 10:18:09,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2025-03-04 10:18:09,558 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2025-03-04 10:18:09,559 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 164 flow [2025-03-04 10:18:09,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.363636363636363) internal successors, (345), 11 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:18:09,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:09,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:09,566 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:18:09,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:09,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:09,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash 45352602, now seen corresponding path program 1 times [2025-03-04 10:18:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:09,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174112448] [2025-03-04 10:18:09,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:09,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:09,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:09,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:09,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:09,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:09,821 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:18:09,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:09,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174112448] [2025-03-04 10:18:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174112448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:09,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:09,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124471937] [2025-03-04 10:18:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:09,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:09,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:09,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:09,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2025-03-04 10:18:09,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:18:09,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:09,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2025-03-04 10:18:09,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:09,972 INFO L124 PetriNetUnfolderBase]: 207/454 cut-off events. [2025-03-04 10:18:09,972 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:18:09,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 454 events. 207/454 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2240 event pairs, 130 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 772. Up to 326 conditions per place. [2025-03-04 10:18:09,974 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 33 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-04 10:18:09,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 218 flow [2025-03-04 10:18:09,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-03-04 10:18:09,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47265625 [2025-03-04 10:18:09,978 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 164 flow. Second operand 4 states and 121 transitions. [2025-03-04 10:18:09,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 218 flow [2025-03-04 10:18:09,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 200 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:09,979 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 134 flow [2025-03-04 10:18:09,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2025-03-04 10:18:09,980 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2025-03-04 10:18:09,980 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 134 flow [2025-03-04 10:18:09,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:18:09,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:09,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:09,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:18:09,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:09,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash 45352603, now seen corresponding path program 1 times [2025-03-04 10:18:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:09,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545753296] [2025-03-04 10:18:09,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:09,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:09,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:09,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:09,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,047 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:18:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545753296] [2025-03-04 10:18:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545753296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:10,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205161434] [2025-03-04 10:18:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:10,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:10,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:10,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:10,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 64 [2025-03-04 10:18:10,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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:18:10,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:10,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 64 [2025-03-04 10:18:10,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:10,140 INFO L124 PetriNetUnfolderBase]: 206/453 cut-off events. [2025-03-04 10:18:10,141 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:18:10,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 453 events. 206/453 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2222 event pairs, 130 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 772. Up to 331 conditions per place. [2025-03-04 10:18:10,143 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-03-04 10:18:10,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 201 flow [2025-03-04 10:18:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-04 10:18:10,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2025-03-04 10:18:10,145 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 134 flow. Second operand 3 states and 127 transitions. [2025-03-04 10:18:10,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 201 flow [2025-03-04 10:18:10,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:10,147 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 129 flow [2025-03-04 10:18:10,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-03-04 10:18:10,149 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2025-03-04 10:18:10,149 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 129 flow [2025-03-04 10:18:10,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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:18:10,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:10,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:10,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:18:10,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:10,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:10,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1993674497, now seen corresponding path program 1 times [2025-03-04 10:18:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833416610] [2025-03-04 10:18:10,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:10,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:10,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:18:10,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:18:10,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,322 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:18:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833416610] [2025-03-04 10:18:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833416610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680534150] [2025-03-04 10:18:10,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:10,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:10,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:10,325 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:18:10,327 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:18:10,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:18:10,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:18:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:18:10,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:10,452 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:18:10,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:10,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:18:10,525 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:18:10,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680534150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:10,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:10,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:10,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21826491] [2025-03-04 10:18:10,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:10,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:10,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:10,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:10,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-03-04 10:18:10,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 129 flow. Second operand has 11 states, 11 states have (on average 32.18181818181818) internal successors, (354), 11 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:10,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:10,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-03-04 10:18:10,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:11,014 INFO L124 PetriNetUnfolderBase]: 485/885 cut-off events. [2025-03-04 10:18:11,015 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:18:11,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 885 events. 485/885 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4587 event pairs, 158 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 1632. Up to 433 conditions per place. [2025-03-04 10:18:11,019 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 57 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-03-04 10:18:11,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 306 flow [2025-03-04 10:18:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2025-03-04 10:18:11,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-04 10:18:11,020 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 129 flow. Second operand 5 states and 210 transitions. [2025-03-04 10:18:11,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 306 flow [2025-03-04 10:18:11,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:11,022 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 144 flow [2025-03-04 10:18:11,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-03-04 10:18:11,022 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2025-03-04 10:18:11,022 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 144 flow [2025-03-04 10:18:11,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.18181818181818) internal successors, (354), 11 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:11,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:11,023 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:11,030 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:18:11,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:18:11,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash 365797060, now seen corresponding path program 1 times [2025-03-04 10:18:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771319284] [2025-03-04 10:18:11,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:11,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:11,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:11,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:11,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771319284] [2025-03-04 10:18:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771319284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772733838] [2025-03-04 10:18:11,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:11,366 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:18:11,368 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:18:11,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:11,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:11,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:11,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:11,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:11,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:11,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:11,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:18:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772733838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:11,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:18:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946984484] [2025-03-04 10:18:11,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:18:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:11,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:18:11,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:18:12,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-03-04 10:18:12,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 144 flow. Second operand has 17 states, 17 states have (on average 31.764705882352942) internal successors, (540), 17 states have internal predecessors, (540), 0 states have call successors, (0), 0 states 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:18:12,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:12,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-03-04 10:18:12,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:12,769 INFO L124 PetriNetUnfolderBase]: 1011/2021 cut-off events. [2025-03-04 10:18:12,770 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-04 10:18:12,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3832 conditions, 2021 events. 1011/2021 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13328 event pairs, 399 based on Foata normal form. 0/1830 useless extension candidates. Maximal degree in co-relation 2146. Up to 661 conditions per place. [2025-03-04 10:18:12,779 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 97 selfloop transitions, 15 changer transitions 0/127 dead transitions. [2025-03-04 10:18:12,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 127 transitions, 534 flow [2025-03-04 10:18:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 351 transitions. [2025-03-04 10:18:12,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.685546875 [2025-03-04 10:18:12,781 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 144 flow. Second operand 8 states and 351 transitions. [2025-03-04 10:18:12,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 127 transitions, 534 flow [2025-03-04 10:18:12,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 525 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:12,783 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 228 flow [2025-03-04 10:18:12,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2025-03-04 10:18:12,784 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2025-03-04 10:18:12,784 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 228 flow [2025-03-04 10:18:12,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 31.764705882352942) internal successors, (540), 17 states have internal predecessors, (540), 0 states have call successors, (0), 0 states 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:18:12,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:12,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:12,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:12,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:12,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 347774660, now seen corresponding path program 1 times [2025-03-04 10:18:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078431966] [2025-03-04 10:18:12,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:12,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:12,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:12,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:12,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:12,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,087 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:18:13,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:13,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078431966] [2025-03-04 10:18:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078431966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:13,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952728584] [2025-03-04 10:18:13,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:13,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:13,090 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:18:13,092 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:18:13,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:13,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:13,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:13,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:18:13,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:13,198 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:18:13,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:13,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:18:13,265 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:18:13,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952728584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:13,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:13,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932926776] [2025-03-04 10:18:13,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:13,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:13,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:13,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:13,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-03-04 10:18:13,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 228 flow. Second operand has 11 states, 11 states have (on average 24.727272727272727) internal successors, (272), 11 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:18:13,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:13,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-03-04 10:18:13,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:13,699 INFO L124 PetriNetUnfolderBase]: 1759/2993 cut-off events. [2025-03-04 10:18:13,700 INFO L125 PetriNetUnfolderBase]: For 1623/1719 co-relation queries the response was YES. [2025-03-04 10:18:13,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 2993 events. 1759/2993 cut-off events. For 1623/1719 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16940 event pairs, 330 based on Foata normal form. 160/2976 useless extension candidates. Maximal degree in co-relation 4446. Up to 2041 conditions per place. [2025-03-04 10:18:13,710 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 63 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2025-03-04 10:18:13,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 458 flow [2025-03-04 10:18:13,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-03-04 10:18:13,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 10:18:13,712 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 228 flow. Second operand 5 states and 176 transitions. [2025-03-04 10:18:13,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 458 flow [2025-03-04 10:18:13,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 451 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:13,718 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 301 flow [2025-03-04 10:18:13,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2025-03-04 10:18:13,720 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2025-03-04 10:18:13,720 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 301 flow [2025-03-04 10:18:13,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.727272727272727) internal successors, (272), 11 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:18:13,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:13,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:13,727 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:18:13,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:13,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2103886801, now seen corresponding path program 1 times [2025-03-04 10:18:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:13,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247082904] [2025-03-04 10:18:13,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:13,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:13,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:18:13,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:18:13,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:13,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:14,049 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:18:14,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247082904] [2025-03-04 10:18:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247082904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579580941] [2025-03-04 10:18:14,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:14,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:14,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:14,051 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:18:14,053 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:18:14,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:18:14,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:18:14,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:14,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:14,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:14,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:14,178 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:18:14,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:14,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:18:14,323 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:18:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579580941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:14,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 10:18:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819053838] [2025-03-04 10:18:14,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:14,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:18:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:14,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:18:14,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:18:14,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-03-04 10:18:14,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 301 flow. Second operand has 14 states, 14 states have (on average 24.357142857142858) internal successors, (341), 14 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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:18:14,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:14,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-03-04 10:18:14,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:14,863 INFO L124 PetriNetUnfolderBase]: 1839/3129 cut-off events. [2025-03-04 10:18:14,863 INFO L125 PetriNetUnfolderBase]: For 2133/2255 co-relation queries the response was YES. [2025-03-04 10:18:14,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8108 conditions, 3129 events. 1839/3129 cut-off events. For 2133/2255 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17752 event pairs, 832 based on Foata normal form. 0/2968 useless extension candidates. Maximal degree in co-relation 4942. Up to 2373 conditions per place. [2025-03-04 10:18:14,878 INFO L140 encePairwiseOnDemand]: 49/64 looper letters, 88 selfloop transitions, 17 changer transitions 0/112 dead transitions. [2025-03-04 10:18:14,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 653 flow [2025-03-04 10:18:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2025-03-04 10:18:14,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 10:18:14,879 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 301 flow. Second operand 7 states and 252 transitions. [2025-03-04 10:18:14,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 653 flow [2025-03-04 10:18:14,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 622 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:14,885 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 360 flow [2025-03-04 10:18:14,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2025-03-04 10:18:14,885 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2025-03-04 10:18:14,885 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 360 flow [2025-03-04 10:18:14,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.357142857142858) internal successors, (341), 14 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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:18:14,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:14,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:14,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:15,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:15,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 130548778, now seen corresponding path program 2 times [2025-03-04 10:18:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581365410] [2025-03-04 10:18:15,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:15,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:18:15,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:18:15,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:15,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:15,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:15,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581365410] [2025-03-04 10:18:15,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581365410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:15,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769985999] [2025-03-04 10:18:15,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:15,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:15,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:15,191 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:18:15,192 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:18:15,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:18:15,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:18:15,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:15,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:15,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:18:15,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:15,242 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:18:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:15,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769985999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:15,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503246673] [2025-03-04 10:18:15,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:15,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:15,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:15,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:15,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-03-04 10:18:15,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 360 flow. Second operand has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:18:15,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:15,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-03-04 10:18:15,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:16,124 INFO L124 PetriNetUnfolderBase]: 1405/2605 cut-off events. [2025-03-04 10:18:16,124 INFO L125 PetriNetUnfolderBase]: For 1498/1498 co-relation queries the response was YES. [2025-03-04 10:18:16,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6594 conditions, 2605 events. 1405/2605 cut-off events. For 1498/1498 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16226 event pairs, 706 based on Foata normal form. 0/2589 useless extension candidates. Maximal degree in co-relation 4157. Up to 1606 conditions per place. [2025-03-04 10:18:16,134 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 80 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-03-04 10:18:16,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 715 flow [2025-03-04 10:18:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2025-03-04 10:18:16,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.628125 [2025-03-04 10:18:16,136 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 360 flow. Second operand 5 states and 201 transitions. [2025-03-04 10:18:16,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 715 flow [2025-03-04 10:18:16,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:18:16,141 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 347 flow [2025-03-04 10:18:16,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2025-03-04 10:18:16,142 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2025-03-04 10:18:16,142 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 347 flow [2025-03-04 10:18:16,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:18:16,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:16,142 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:16,148 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:18:16,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:16,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash -806648951, now seen corresponding path program 2 times [2025-03-04 10:18:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826714929] [2025-03-04 10:18:16,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:16,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:16,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:18:16,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-04 10:18:16,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:16,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:16,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826714929] [2025-03-04 10:18:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826714929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:16,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306316619] [2025-03-04 10:18:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:16,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:16,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:16,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:16,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-03-04 10:18:16,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:18:16,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:16,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-03-04 10:18:16,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:16,828 INFO L124 PetriNetUnfolderBase]: 1666/2817 cut-off events. [2025-03-04 10:18:16,829 INFO L125 PetriNetUnfolderBase]: For 3395/3395 co-relation queries the response was YES. [2025-03-04 10:18:16,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7703 conditions, 2817 events. 1666/2817 cut-off events. For 3395/3395 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15542 event pairs, 970 based on Foata normal form. 96/2704 useless extension candidates. Maximal degree in co-relation 4668. Up to 2060 conditions per place. [2025-03-04 10:18:16,844 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 63 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2025-03-04 10:18:16,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 532 flow [2025-03-04 10:18:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-03-04 10:18:16,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4875 [2025-03-04 10:18:16,845 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 347 flow. Second operand 5 states and 156 transitions. [2025-03-04 10:18:16,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 532 flow [2025-03-04 10:18:16,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 500 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:16,849 INFO L231 Difference]: Finished difference. Result has 61 places, 67 transitions, 327 flow [2025-03-04 10:18:16,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=61, PETRI_TRANSITIONS=67} [2025-03-04 10:18:16,850 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2025-03-04 10:18:16,850 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 67 transitions, 327 flow [2025-03-04 10:18:16,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:18:16,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:16,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:18:16,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1093384761, now seen corresponding path program 1 times [2025-03-04 10:18:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843918980] [2025-03-04 10:18:16,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:16,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:18:16,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:18:16,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:16,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:17,002 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:18:17,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:17,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843918980] [2025-03-04 10:18:17,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843918980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:17,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334285174] [2025-03-04 10:18:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:17,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:17,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:17,005 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:18:17,006 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:18:17,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:18:17,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:18:17,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:17,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:17,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:17,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:17,162 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:18:17,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:17,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 10:18:17,351 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:18:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334285174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:17,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:18:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7795091] [2025-03-04 10:18:17,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:17,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:18:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:17,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:18:17,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:18:17,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-03-04 10:18:17,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 67 transitions, 327 flow. Second operand has 17 states, 17 states have (on average 24.11764705882353) internal successors, (410), 17 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:18:17,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:17,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-03-04 10:18:17,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:18,240 INFO L124 PetriNetUnfolderBase]: 1552/2634 cut-off events. [2025-03-04 10:18:18,240 INFO L125 PetriNetUnfolderBase]: For 2048/2048 co-relation queries the response was YES. [2025-03-04 10:18:18,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 2634 events. 1552/2634 cut-off events. For 2048/2048 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14334 event pairs, 736 based on Foata normal form. 16/2555 useless extension candidates. Maximal degree in co-relation 4411. Up to 1197 conditions per place. [2025-03-04 10:18:18,255 INFO L140 encePairwiseOnDemand]: 43/64 looper letters, 93 selfloop transitions, 27 changer transitions 0/126 dead transitions. [2025-03-04 10:18:18,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 126 transitions, 738 flow [2025-03-04 10:18:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 285 transitions. [2025-03-04 10:18:18,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.556640625 [2025-03-04 10:18:18,258 INFO L175 Difference]: Start difference. First operand has 61 places, 67 transitions, 327 flow. Second operand 8 states and 285 transitions. [2025-03-04 10:18:18,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 126 transitions, 738 flow [2025-03-04 10:18:18,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 716 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:18,265 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 461 flow [2025-03-04 10:18:18,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=461, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2025-03-04 10:18:18,266 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2025-03-04 10:18:18,266 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 461 flow [2025-03-04 10:18:18,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 24.11764705882353) internal successors, (410), 17 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:18:18,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:18,267 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:18,273 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:18:18,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:18,467 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:18,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2096524525, now seen corresponding path program 2 times [2025-03-04 10:18:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523135442] [2025-03-04 10:18:18,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:18,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:18:18,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-03-04 10:18:18,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:18,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523135442] [2025-03-04 10:18:18,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523135442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:18,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878814684] [2025-03-04 10:18:18,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:18,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:18,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:18,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:18,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:18,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-03-04 10:18:18,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:18,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:18,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-03-04 10:18:18,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:18,999 INFO L124 PetriNetUnfolderBase]: 1445/2487 cut-off events. [2025-03-04 10:18:18,999 INFO L125 PetriNetUnfolderBase]: For 3194/3194 co-relation queries the response was YES. [2025-03-04 10:18:19,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7323 conditions, 2487 events. 1445/2487 cut-off events. For 3194/3194 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13802 event pairs, 212 based on Foata normal form. 16/2459 useless extension candidates. Maximal degree in co-relation 4652. Up to 1058 conditions per place. [2025-03-04 10:18:19,007 INFO L140 encePairwiseOnDemand]: 45/64 looper letters, 62 selfloop transitions, 45 changer transitions 0/113 dead transitions. [2025-03-04 10:18:19,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 113 transitions, 869 flow [2025-03-04 10:18:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-03-04 10:18:19,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2025-03-04 10:18:19,009 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 461 flow. Second operand 6 states and 201 transitions. [2025-03-04 10:18:19,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 113 transitions, 869 flow [2025-03-04 10:18:19,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 113 transitions, 851 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:18:19,015 INFO L231 Difference]: Finished difference. Result has 64 places, 92 transitions, 769 flow [2025-03-04 10:18:19,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=769, PETRI_PLACES=64, PETRI_TRANSITIONS=92} [2025-03-04 10:18:19,016 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2025-03-04 10:18:19,016 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 92 transitions, 769 flow [2025-03-04 10:18:19,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:19,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:19,017 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] [2025-03-04 10:18:19,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:18:19,017 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:19,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash 632868918, now seen corresponding path program 1 times [2025-03-04 10:18:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:19,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120998438] [2025-03-04 10:18:19,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:19,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:19,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:18:19,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:18:19,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:19,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:19,041 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:18:19,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:19,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120998438] [2025-03-04 10:18:19,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120998438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:19,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:19,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615533102] [2025-03-04 10:18:19,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:19,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:19,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:19,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:19,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 64 [2025-03-04 10:18:19,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 92 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:18:19,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:19,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 64 [2025-03-04 10:18:19,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:19,208 INFO L124 PetriNetUnfolderBase]: 1399/2437 cut-off events. [2025-03-04 10:18:19,208 INFO L125 PetriNetUnfolderBase]: For 5947/6001 co-relation queries the response was YES. [2025-03-04 10:18:19,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8583 conditions, 2437 events. 1399/2437 cut-off events. For 5947/6001 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13768 event pairs, 362 based on Foata normal form. 30/2423 useless extension candidates. Maximal degree in co-relation 5589. Up to 1849 conditions per place. [2025-03-04 10:18:19,219 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 82 selfloop transitions, 13 changer transitions 1/102 dead transitions. [2025-03-04 10:18:19,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 102 transitions, 986 flow [2025-03-04 10:18:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2025-03-04 10:18:19,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2025-03-04 10:18:19,220 INFO L175 Difference]: Start difference. First operand has 64 places, 92 transitions, 769 flow. Second operand 3 states and 146 transitions. [2025-03-04 10:18:19,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 102 transitions, 986 flow [2025-03-04 10:18:19,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 946 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:19,261 INFO L231 Difference]: Finished difference. Result has 65 places, 92 transitions, 770 flow [2025-03-04 10:18:19,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=65, PETRI_TRANSITIONS=92} [2025-03-04 10:18:19,263 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2025-03-04 10:18:19,263 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 92 transitions, 770 flow [2025-03-04 10:18:19,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:18:19,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:19,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:19,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:18:19,263 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:19,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:19,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1425480923, now seen corresponding path program 1 times [2025-03-04 10:18:19,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:19,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520857508] [2025-03-04 10:18:19,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:19,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:19,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:18:19,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:18:19,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:19,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:19,462 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:18:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:19,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520857508] [2025-03-04 10:18:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520857508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:19,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123935876] [2025-03-04 10:18:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:19,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:19,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:19,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:19,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 92 transitions, 770 flow. Second operand has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:18:19,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:19,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:19,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:19,865 INFO L124 PetriNetUnfolderBase]: 1643/2681 cut-off events. [2025-03-04 10:18:19,865 INFO L125 PetriNetUnfolderBase]: For 4805/4805 co-relation queries the response was YES. [2025-03-04 10:18:19,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9254 conditions, 2681 events. 1643/2681 cut-off events. For 4805/4805 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 13524 event pairs, 379 based on Foata normal form. 80/2761 useless extension candidates. Maximal degree in co-relation 5576. Up to 970 conditions per place. [2025-03-04 10:18:19,877 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 188 selfloop transitions, 45 changer transitions 0/234 dead transitions. [2025-03-04 10:18:19,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 234 transitions, 2058 flow [2025-03-04 10:18:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:18:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:18:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 475 transitions. [2025-03-04 10:18:19,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6184895833333334 [2025-03-04 10:18:19,879 INFO L175 Difference]: Start difference. First operand has 65 places, 92 transitions, 770 flow. Second operand 12 states and 475 transitions. [2025-03-04 10:18:19,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 234 transitions, 2058 flow [2025-03-04 10:18:19,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 234 transitions, 1949 flow, removed 29 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:19,893 INFO L231 Difference]: Finished difference. Result has 81 places, 100 transitions, 893 flow [2025-03-04 10:18:19,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=893, PETRI_PLACES=81, PETRI_TRANSITIONS=100} [2025-03-04 10:18:19,893 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2025-03-04 10:18:19,893 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 100 transitions, 893 flow [2025-03-04 10:18:19,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:18:19,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:19,894 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] [2025-03-04 10:18:19,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:18:19,894 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:19,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1907098458, now seen corresponding path program 1 times [2025-03-04 10:18:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381933310] [2025-03-04 10:18:19,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:19,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:19,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:19,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:19,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:19,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:20,001 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:18:20,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381933310] [2025-03-04 10:18:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381933310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:20,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843659185] [2025-03-04 10:18:20,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:20,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:20,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:20,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:20,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-03-04 10:18:20,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 100 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:18:20,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:20,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-03-04 10:18:20,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:20,416 INFO L124 PetriNetUnfolderBase]: 1569/2619 cut-off events. [2025-03-04 10:18:20,416 INFO L125 PetriNetUnfolderBase]: For 8087/8095 co-relation queries the response was YES. [2025-03-04 10:18:20,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10555 conditions, 2619 events. 1569/2619 cut-off events. For 8087/8095 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13622 event pairs, 607 based on Foata normal form. 14/2625 useless extension candidates. Maximal degree in co-relation 6950. Up to 1468 conditions per place. [2025-03-04 10:18:20,432 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 156 selfloop transitions, 23 changer transitions 0/182 dead transitions. [2025-03-04 10:18:20,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 182 transitions, 1872 flow [2025-03-04 10:18:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2025-03-04 10:18:20,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.715625 [2025-03-04 10:18:20,433 INFO L175 Difference]: Start difference. First operand has 81 places, 100 transitions, 893 flow. Second operand 5 states and 229 transitions. [2025-03-04 10:18:20,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 182 transitions, 1872 flow [2025-03-04 10:18:20,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 182 transitions, 1834 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:20,455 INFO L231 Difference]: Finished difference. Result has 85 places, 103 transitions, 976 flow [2025-03-04 10:18:20,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=976, PETRI_PLACES=85, PETRI_TRANSITIONS=103} [2025-03-04 10:18:20,455 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 24 predicate places. [2025-03-04 10:18:20,455 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 103 transitions, 976 flow [2025-03-04 10:18:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:18:20,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:20,456 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] [2025-03-04 10:18:20,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:18:20,456 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1826212352, now seen corresponding path program 2 times [2025-03-04 10:18:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:20,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605540698] [2025-03-04 10:18:20,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:20,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:20,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 10:18:20,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:20,528 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:18:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605540698] [2025-03-04 10:18:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605540698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277315385] [2025-03-04 10:18:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:20,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:20,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:20,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:20,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 103 transitions, 976 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:20,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:20,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:20,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:20,848 INFO L124 PetriNetUnfolderBase]: 1723/2817 cut-off events. [2025-03-04 10:18:20,848 INFO L125 PetriNetUnfolderBase]: For 10046/10046 co-relation queries the response was YES. [2025-03-04 10:18:20,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12291 conditions, 2817 events. 1723/2817 cut-off events. For 10046/10046 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 14372 event pairs, 673 based on Foata normal form. 6/2823 useless extension candidates. Maximal degree in co-relation 11800. Up to 1608 conditions per place. [2025-03-04 10:18:20,862 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 130 selfloop transitions, 32 changer transitions 0/163 dead transitions. [2025-03-04 10:18:20,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 163 transitions, 1784 flow [2025-03-04 10:18:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-03-04 10:18:20,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.659375 [2025-03-04 10:18:20,863 INFO L175 Difference]: Start difference. First operand has 85 places, 103 transitions, 976 flow. Second operand 5 states and 211 transitions. [2025-03-04 10:18:20,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 163 transitions, 1784 flow [2025-03-04 10:18:20,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 163 transitions, 1761 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:20,891 INFO L231 Difference]: Finished difference. Result has 90 places, 114 transitions, 1230 flow [2025-03-04 10:18:20,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1230, PETRI_PLACES=90, PETRI_TRANSITIONS=114} [2025-03-04 10:18:20,892 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 29 predicate places. [2025-03-04 10:18:20,892 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 114 transitions, 1230 flow [2025-03-04 10:18:20,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:20,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:20,892 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] [2025-03-04 10:18:20,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:18:20,892 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:20,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash -455766014, now seen corresponding path program 3 times [2025-03-04 10:18:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:20,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73569161] [2025-03-04 10:18:20,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:20,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:20,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 10:18:20,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:20,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:21,031 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:18:21,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:21,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73569161] [2025-03-04 10:18:21,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73569161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:21,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:21,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:21,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774573024] [2025-03-04 10:18:21,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:21,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:21,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:21,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:21,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:21,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 114 transitions, 1230 flow. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:18:21,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:21,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:21,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:21,307 INFO L124 PetriNetUnfolderBase]: 1827/2985 cut-off events. [2025-03-04 10:18:21,307 INFO L125 PetriNetUnfolderBase]: For 11413/11413 co-relation queries the response was YES. [2025-03-04 10:18:21,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13177 conditions, 2985 events. 1827/2985 cut-off events. For 11413/11413 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15432 event pairs, 671 based on Foata normal form. 24/3009 useless extension candidates. Maximal degree in co-relation 12683. Up to 1640 conditions per place. [2025-03-04 10:18:21,320 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 146 selfloop transitions, 36 changer transitions 0/183 dead transitions. [2025-03-04 10:18:21,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 183 transitions, 2074 flow [2025-03-04 10:18:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 248 transitions. [2025-03-04 10:18:21,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-04 10:18:21,321 INFO L175 Difference]: Start difference. First operand has 90 places, 114 transitions, 1230 flow. Second operand 6 states and 248 transitions. [2025-03-04 10:18:21,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 183 transitions, 2074 flow [2025-03-04 10:18:21,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 183 transitions, 2045 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:21,349 INFO L231 Difference]: Finished difference. Result has 96 places, 119 transitions, 1354 flow [2025-03-04 10:18:21,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1354, PETRI_PLACES=96, PETRI_TRANSITIONS=119} [2025-03-04 10:18:21,350 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2025-03-04 10:18:21,350 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 119 transitions, 1354 flow [2025-03-04 10:18:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:18:21,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:21,350 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] [2025-03-04 10:18:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:18:21,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:21,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1617982708, now seen corresponding path program 4 times [2025-03-04 10:18:21,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:21,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906106225] [2025-03-04 10:18:21,350 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:21,355 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:21,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:21,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:21,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:21,510 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:18:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906106225] [2025-03-04 10:18:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906106225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:21,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:21,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:21,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509345069] [2025-03-04 10:18:21,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:21,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:21,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:21,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:25,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:18:25,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:25,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 119 transitions, 1354 flow. Second operand has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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:18:25,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:25,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:25,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:25,899 INFO L124 PetriNetUnfolderBase]: 1891/3165 cut-off events. [2025-03-04 10:18:25,899 INFO L125 PetriNetUnfolderBase]: For 12888/12888 co-relation queries the response was YES. [2025-03-04 10:18:25,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14163 conditions, 3165 events. 1891/3165 cut-off events. For 12888/12888 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16600 event pairs, 811 based on Foata normal form. 40/3205 useless extension candidates. Maximal degree in co-relation 13677. Up to 1906 conditions per place. [2025-03-04 10:18:25,913 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 142 selfloop transitions, 39 changer transitions 0/182 dead transitions. [2025-03-04 10:18:25,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 182 transitions, 2190 flow [2025-03-04 10:18:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 264 transitions. [2025-03-04 10:18:25,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-04 10:18:25,915 INFO L175 Difference]: Start difference. First operand has 96 places, 119 transitions, 1354 flow. Second operand 7 states and 264 transitions. [2025-03-04 10:18:25,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 182 transitions, 2190 flow [2025-03-04 10:18:25,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 182 transitions, 2108 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:25,943 INFO L231 Difference]: Finished difference. Result has 102 places, 123 transitions, 1430 flow [2025-03-04 10:18:25,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1430, PETRI_PLACES=102, PETRI_TRANSITIONS=123} [2025-03-04 10:18:25,944 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 41 predicate places. [2025-03-04 10:18:25,944 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 1430 flow [2025-03-04 10:18:25,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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:18:25,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:25,944 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:18:25,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:18:25,945 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:25,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1887904889, now seen corresponding path program 1 times [2025-03-04 10:18:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:25,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367568085] [2025-03-04 10:18:25,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:18:25,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:18:25,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:25,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:26,050 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:18:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367568085] [2025-03-04 10:18:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367568085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:26,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341877353] [2025-03-04 10:18:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:26,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:26,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:26,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:26,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:26,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 123 transitions, 1430 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:18:26,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:26,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:26,474 INFO L124 PetriNetUnfolderBase]: 2053/3483 cut-off events. [2025-03-04 10:18:26,474 INFO L125 PetriNetUnfolderBase]: For 14238/14238 co-relation queries the response was YES. [2025-03-04 10:18:26,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15645 conditions, 3483 events. 2053/3483 cut-off events. For 14238/14238 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19098 event pairs, 1115 based on Foata normal form. 32/3515 useless extension candidates. Maximal degree in co-relation 14851. Up to 2718 conditions per place. [2025-03-04 10:18:26,490 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 124 selfloop transitions, 43 changer transitions 0/168 dead transitions. [2025-03-04 10:18:26,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 168 transitions, 2127 flow [2025-03-04 10:18:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2025-03-04 10:18:26,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-03-04 10:18:26,492 INFO L175 Difference]: Start difference. First operand has 102 places, 123 transitions, 1430 flow. Second operand 6 states and 234 transitions. [2025-03-04 10:18:26,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 168 transitions, 2127 flow [2025-03-04 10:18:26,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 168 transitions, 2051 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:26,532 INFO L231 Difference]: Finished difference. Result has 104 places, 131 transitions, 1586 flow [2025-03-04 10:18:26,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1586, PETRI_PLACES=104, PETRI_TRANSITIONS=131} [2025-03-04 10:18:26,533 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 43 predicate places. [2025-03-04 10:18:26,533 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 131 transitions, 1586 flow [2025-03-04 10:18:26,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:18:26,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:26,533 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:18:26,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:18:26,534 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:26,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:26,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1746162169, now seen corresponding path program 2 times [2025-03-04 10:18:26,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:26,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399245479] [2025-03-04 10:18:26,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:26,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:18:26,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-03-04 10:18:26,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:26,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:26,611 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:18:26,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:26,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399245479] [2025-03-04 10:18:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399245479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:26,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:26,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:26,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672119246] [2025-03-04 10:18:26,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:26,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:26,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:26,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:26,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:26,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:26,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 131 transitions, 1586 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:18:26,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:26,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:27,016 INFO L124 PetriNetUnfolderBase]: 2005/3351 cut-off events. [2025-03-04 10:18:27,016 INFO L125 PetriNetUnfolderBase]: For 14210/14210 co-relation queries the response was YES. [2025-03-04 10:18:27,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15246 conditions, 3351 events. 2005/3351 cut-off events. For 14210/14210 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17794 event pairs, 1199 based on Foata normal form. 6/3357 useless extension candidates. Maximal degree in co-relation 14969. Up to 2878 conditions per place. [2025-03-04 10:18:27,029 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 107 selfloop transitions, 38 changer transitions 0/146 dead transitions. [2025-03-04 10:18:27,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 146 transitions, 1942 flow [2025-03-04 10:18:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2025-03-04 10:18:27,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596875 [2025-03-04 10:18:27,030 INFO L175 Difference]: Start difference. First operand has 104 places, 131 transitions, 1586 flow. Second operand 5 states and 191 transitions. [2025-03-04 10:18:27,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 146 transitions, 1942 flow [2025-03-04 10:18:27,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 146 transitions, 1849 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 10:18:27,061 INFO L231 Difference]: Finished difference. Result has 103 places, 130 transitions, 1557 flow [2025-03-04 10:18:27,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1557, PETRI_PLACES=103, PETRI_TRANSITIONS=130} [2025-03-04 10:18:27,061 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 42 predicate places. [2025-03-04 10:18:27,061 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 130 transitions, 1557 flow [2025-03-04 10:18:27,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:18:27,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:27,061 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:18:27,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:18:27,062 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:27,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1492377377, now seen corresponding path program 3 times [2025-03-04 10:18:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:27,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804673167] [2025-03-04 10:18:27,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:27,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:18:27,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-03-04 10:18:27,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:27,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:27,151 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:18:27,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:27,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804673167] [2025-03-04 10:18:27,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804673167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:27,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:27,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:27,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678265678] [2025-03-04 10:18:27,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:27,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:27,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:27,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:27,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:27,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 130 transitions, 1557 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:18:27,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:27,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:27,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:27,505 INFO L124 PetriNetUnfolderBase]: 2117/3543 cut-off events. [2025-03-04 10:18:27,506 INFO L125 PetriNetUnfolderBase]: For 15883/15883 co-relation queries the response was YES. [2025-03-04 10:18:27,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16027 conditions, 3543 events. 2117/3543 cut-off events. For 15883/15883 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19128 event pairs, 1209 based on Foata normal form. 32/3575 useless extension candidates. Maximal degree in co-relation 14443. Up to 2910 conditions per place. [2025-03-04 10:18:27,570 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 129 selfloop transitions, 39 changer transitions 0/169 dead transitions. [2025-03-04 10:18:27,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 169 transitions, 2195 flow [2025-03-04 10:18:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-03-04 10:18:27,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2025-03-04 10:18:27,572 INFO L175 Difference]: Start difference. First operand has 103 places, 130 transitions, 1557 flow. Second operand 6 states and 226 transitions. [2025-03-04 10:18:27,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 169 transitions, 2195 flow [2025-03-04 10:18:27,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 169 transitions, 2105 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:27,607 INFO L231 Difference]: Finished difference. Result has 105 places, 134 transitions, 1619 flow [2025-03-04 10:18:27,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1619, PETRI_PLACES=105, PETRI_TRANSITIONS=134} [2025-03-04 10:18:27,608 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 44 predicate places. [2025-03-04 10:18:27,608 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 134 transitions, 1619 flow [2025-03-04 10:18:27,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:18:27,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:27,608 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:18:27,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:18:27,608 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:27,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1303308999, now seen corresponding path program 4 times [2025-03-04 10:18:27,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:27,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352060167] [2025-03-04 10:18:27,609 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:27,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:18:27,628 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:18:27,630 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:27,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:27,782 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:18:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:27,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352060167] [2025-03-04 10:18:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352060167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:27,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908556631] [2025-03-04 10:18:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:27,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:27,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:27,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:27,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-03-04 10:18:27,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 134 transitions, 1619 flow. Second operand has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:27,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:27,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-03-04 10:18:27,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:28,305 INFO L124 PetriNetUnfolderBase]: 1811/3195 cut-off events. [2025-03-04 10:18:28,305 INFO L125 PetriNetUnfolderBase]: For 14925/14925 co-relation queries the response was YES. [2025-03-04 10:18:28,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14367 conditions, 3195 events. 1811/3195 cut-off events. For 14925/14925 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18143 event pairs, 599 based on Foata normal form. 28/3223 useless extension candidates. Maximal degree in co-relation 13439. Up to 1416 conditions per place. [2025-03-04 10:18:28,321 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 136 selfloop transitions, 51 changer transitions 0/192 dead transitions. [2025-03-04 10:18:28,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 192 transitions, 2361 flow [2025-03-04 10:18:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:18:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:18:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 359 transitions. [2025-03-04 10:18:28,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6232638888888888 [2025-03-04 10:18:28,323 INFO L175 Difference]: Start difference. First operand has 105 places, 134 transitions, 1619 flow. Second operand 9 states and 359 transitions. [2025-03-04 10:18:28,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 192 transitions, 2361 flow [2025-03-04 10:18:28,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 192 transitions, 2252 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 10:18:28,362 INFO L231 Difference]: Finished difference. Result has 107 places, 135 transitions, 1621 flow [2025-03-04 10:18:28,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1621, PETRI_PLACES=107, PETRI_TRANSITIONS=135} [2025-03-04 10:18:28,362 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 46 predicate places. [2025-03-04 10:18:28,363 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 135 transitions, 1621 flow [2025-03-04 10:18:28,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:28,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:28,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:28,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:18:28,363 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:28,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1860936758, now seen corresponding path program 1 times [2025-03-04 10:18:28,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:28,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712493770] [2025-03-04 10:18:28,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:28,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:28,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:28,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:28,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:28,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:28,469 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:18:28,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:28,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712493770] [2025-03-04 10:18:28,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712493770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:28,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:28,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724554410] [2025-03-04 10:18:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:28,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:28,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:28,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:28,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:28,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-03-04 10:18:28,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 135 transitions, 1621 flow. Second operand has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:18:28,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:28,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-03-04 10:18:28,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:29,080 INFO L124 PetriNetUnfolderBase]: 2827/4791 cut-off events. [2025-03-04 10:18:29,080 INFO L125 PetriNetUnfolderBase]: For 20555/20585 co-relation queries the response was YES. [2025-03-04 10:18:29,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20968 conditions, 4791 events. 2827/4791 cut-off events. For 20555/20585 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 29024 event pairs, 709 based on Foata normal form. 50/4825 useless extension candidates. Maximal degree in co-relation 19572. Up to 1578 conditions per place. [2025-03-04 10:18:29,104 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 285 selfloop transitions, 43 changer transitions 7/338 dead transitions. [2025-03-04 10:18:29,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 338 transitions, 4134 flow [2025-03-04 10:18:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2025-03-04 10:18:29,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7589285714285714 [2025-03-04 10:18:29,106 INFO L175 Difference]: Start difference. First operand has 107 places, 135 transitions, 1621 flow. Second operand 7 states and 340 transitions. [2025-03-04 10:18:29,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 338 transitions, 4134 flow [2025-03-04 10:18:29,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 338 transitions, 3966 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 10:18:29,155 INFO L231 Difference]: Finished difference. Result has 112 places, 143 transitions, 1753 flow [2025-03-04 10:18:29,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1753, PETRI_PLACES=112, PETRI_TRANSITIONS=143} [2025-03-04 10:18:29,156 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 51 predicate places. [2025-03-04 10:18:29,156 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 143 transitions, 1753 flow [2025-03-04 10:18:29,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:18:29,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:29,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:29,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:18:29,157 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:29,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1673662062, now seen corresponding path program 2 times [2025-03-04 10:18:29,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:29,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032576379] [2025-03-04 10:18:29,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:29,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:29,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:18:29,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-04 10:18:29,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:29,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:18:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:29,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032576379] [2025-03-04 10:18:29,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032576379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:29,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:29,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:29,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543098205] [2025-03-04 10:18:29,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:29,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:29,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:29,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:29,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:29,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:29,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 143 transitions, 1753 flow. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:18:29,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:29,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:29,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:29,733 INFO L124 PetriNetUnfolderBase]: 2809/4707 cut-off events. [2025-03-04 10:18:29,734 INFO L125 PetriNetUnfolderBase]: For 23611/23611 co-relation queries the response was YES. [2025-03-04 10:18:29,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23141 conditions, 4707 events. 2809/4707 cut-off events. For 23611/23611 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 26583 event pairs, 1259 based on Foata normal form. 64/4771 useless extension candidates. Maximal degree in co-relation 21813. Up to 2904 conditions per place. [2025-03-04 10:18:29,757 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 190 selfloop transitions, 56 changer transitions 2/249 dead transitions. [2025-03-04 10:18:29,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 249 transitions, 3323 flow [2025-03-04 10:18:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 294 transitions. [2025-03-04 10:18:29,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.57421875 [2025-03-04 10:18:29,758 INFO L175 Difference]: Start difference. First operand has 112 places, 143 transitions, 1753 flow. Second operand 8 states and 294 transitions. [2025-03-04 10:18:29,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 249 transitions, 3323 flow [2025-03-04 10:18:29,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 249 transitions, 3248 flow, removed 27 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:29,817 INFO L231 Difference]: Finished difference. Result has 120 places, 155 transitions, 2019 flow [2025-03-04 10:18:29,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2019, PETRI_PLACES=120, PETRI_TRANSITIONS=155} [2025-03-04 10:18:29,818 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 59 predicate places. [2025-03-04 10:18:29,818 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 155 transitions, 2019 flow [2025-03-04 10:18:29,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:18:29,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:29,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:29,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:18:29,818 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:29,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1730361004, now seen corresponding path program 1 times [2025-03-04 10:18:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:29,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096686463] [2025-03-04 10:18:29,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:29,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:29,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:18:29,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:29,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:29,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:30,008 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:18:30,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:30,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096686463] [2025-03-04 10:18:30,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096686463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:30,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:30,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:18:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125196651] [2025-03-04 10:18:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:30,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:30,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:30,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:30,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 155 transitions, 2019 flow. Second operand has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:18:30,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:30,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:30,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:30,685 INFO L124 PetriNetUnfolderBase]: 2882/4847 cut-off events. [2025-03-04 10:18:30,685 INFO L125 PetriNetUnfolderBase]: For 26117/26117 co-relation queries the response was YES. [2025-03-04 10:18:30,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24345 conditions, 4847 events. 2882/4847 cut-off events. For 26117/26117 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 27745 event pairs, 1598 based on Foata normal form. 6/4853 useless extension candidates. Maximal degree in co-relation 22963. Up to 3734 conditions per place. [2025-03-04 10:18:30,711 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 176 selfloop transitions, 51 changer transitions 0/228 dead transitions. [2025-03-04 10:18:30,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 228 transitions, 3060 flow [2025-03-04 10:18:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 368 transitions. [2025-03-04 10:18:30,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-04 10:18:30,712 INFO L175 Difference]: Start difference. First operand has 120 places, 155 transitions, 2019 flow. Second operand 11 states and 368 transitions. [2025-03-04 10:18:30,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 228 transitions, 3060 flow [2025-03-04 10:18:30,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 228 transitions, 2981 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 10:18:30,784 INFO L231 Difference]: Finished difference. Result has 132 places, 168 transitions, 2214 flow [2025-03-04 10:18:30,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2214, PETRI_PLACES=132, PETRI_TRANSITIONS=168} [2025-03-04 10:18:30,785 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 71 predicate places. [2025-03-04 10:18:30,785 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 168 transitions, 2214 flow [2025-03-04 10:18:30,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:18:30,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:30,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:30,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:18:30,785 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:30,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1990412404, now seen corresponding path program 2 times [2025-03-04 10:18:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:30,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217688560] [2025-03-04 10:18:30,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:30,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:18:30,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-03-04 10:18:30,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:30,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:30,964 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:18:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217688560] [2025-03-04 10:18:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217688560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:18:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540611760] [2025-03-04 10:18:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:30,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:30,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:30,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:31,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:31,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 168 transitions, 2214 flow. Second operand has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:18:31,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:31,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:31,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:31,638 INFO L124 PetriNetUnfolderBase]: 2951/4977 cut-off events. [2025-03-04 10:18:31,639 INFO L125 PetriNetUnfolderBase]: For 28948/28948 co-relation queries the response was YES. [2025-03-04 10:18:31,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25644 conditions, 4977 events. 2951/4977 cut-off events. For 28948/28948 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 28945 event pairs, 1583 based on Foata normal form. 6/4983 useless extension candidates. Maximal degree in co-relation 24271. Up to 3724 conditions per place. [2025-03-04 10:18:31,671 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 196 selfloop transitions, 54 changer transitions 0/251 dead transitions. [2025-03-04 10:18:31,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 251 transitions, 3445 flow [2025-03-04 10:18:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 372 transitions. [2025-03-04 10:18:31,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2025-03-04 10:18:31,672 INFO L175 Difference]: Start difference. First operand has 132 places, 168 transitions, 2214 flow. Second operand 11 states and 372 transitions. [2025-03-04 10:18:31,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 251 transitions, 3445 flow [2025-03-04 10:18:31,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 251 transitions, 3441 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:31,757 INFO L231 Difference]: Finished difference. Result has 147 places, 179 transitions, 2461 flow [2025-03-04 10:18:31,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2461, PETRI_PLACES=147, PETRI_TRANSITIONS=179} [2025-03-04 10:18:31,758 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 86 predicate places. [2025-03-04 10:18:31,758 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 179 transitions, 2461 flow [2025-03-04 10:18:31,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:18:31,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:31,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:31,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 10:18:31,758 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:31,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:31,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1805384204, now seen corresponding path program 1 times [2025-03-04 10:18:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:31,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536288537] [2025-03-04 10:18:31,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:31,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:18:31,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:31,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:31,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:31,901 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:18:31,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:31,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536288537] [2025-03-04 10:18:31,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536288537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:31,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:31,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:31,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864929759] [2025-03-04 10:18:31,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:31,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:18:31,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:31,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:18:31,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:18:31,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 64 [2025-03-04 10:18:31,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 179 transitions, 2461 flow. Second operand has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:18:31,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:31,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 64 [2025-03-04 10:18:31,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:32,956 INFO L124 PetriNetUnfolderBase]: 3156/5352 cut-off events. [2025-03-04 10:18:32,956 INFO L125 PetriNetUnfolderBase]: For 36033/36041 co-relation queries the response was YES. [2025-03-04 10:18:32,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28908 conditions, 5352 events. 3156/5352 cut-off events. For 36033/36041 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 32725 event pairs, 842 based on Foata normal form. 52/5400 useless extension candidates. Maximal degree in co-relation 27521. Up to 1716 conditions per place. [2025-03-04 10:18:32,990 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 324 selfloop transitions, 80 changer transitions 2/408 dead transitions. [2025-03-04 10:18:32,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 408 transitions, 5677 flow [2025-03-04 10:18:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 462 transitions. [2025-03-04 10:18:32,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-04 10:18:32,991 INFO L175 Difference]: Start difference. First operand has 147 places, 179 transitions, 2461 flow. Second operand 11 states and 462 transitions. [2025-03-04 10:18:32,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 408 transitions, 5677 flow [2025-03-04 10:18:33,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 408 transitions, 5567 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:33,133 INFO L231 Difference]: Finished difference. Result has 162 places, 209 transitions, 3180 flow [2025-03-04 10:18:33,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3180, PETRI_PLACES=162, PETRI_TRANSITIONS=209} [2025-03-04 10:18:33,133 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 101 predicate places. [2025-03-04 10:18:33,133 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 209 transitions, 3180 flow [2025-03-04 10:18:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:18:33,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:33,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:33,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 10:18:33,133 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:33,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2086671126, now seen corresponding path program 2 times [2025-03-04 10:18:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267689779] [2025-03-04 10:18:33,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:33,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:33,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:18:33,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:33,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:33,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:33,257 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:18:33,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:33,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267689779] [2025-03-04 10:18:33,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267689779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081411225] [2025-03-04 10:18:33,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:33,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:33,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:33,261 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:18:33,262 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:18:33,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:18:33,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:33,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:33,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:33,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:18:33,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:33,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:33,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:18:33,485 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:18:33,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:33,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 10:18:33,725 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:18:33,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-04 10:18:33,766 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:18:33,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081411225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:33,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:33,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-04 10:18:33,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292325018] [2025-03-04 10:18:33,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:33,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:18:33,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:33,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:18:33,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:18:34,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:34,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 209 transitions, 3180 flow. Second operand has 18 states, 18 states have (on average 30.166666666666668) internal successors, (543), 18 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:18:34,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:34,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:34,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:36,347 INFO L124 PetriNetUnfolderBase]: 4146/7024 cut-off events. [2025-03-04 10:18:36,347 INFO L125 PetriNetUnfolderBase]: For 54794/54794 co-relation queries the response was YES. [2025-03-04 10:18:36,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39008 conditions, 7024 events. 4146/7024 cut-off events. For 54794/54794 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 42472 event pairs, 538 based on Foata normal form. 81/7105 useless extension candidates. Maximal degree in co-relation 37461. Up to 1586 conditions per place. [2025-03-04 10:18:36,382 INFO L140 encePairwiseOnDemand]: 41/64 looper letters, 246 selfloop transitions, 157 changer transitions 230/634 dead transitions. [2025-03-04 10:18:36,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 634 transitions, 8478 flow [2025-03-04 10:18:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:18:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 10:18:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 1343 transitions. [2025-03-04 10:18:36,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5828993055555556 [2025-03-04 10:18:36,384 INFO L175 Difference]: Start difference. First operand has 162 places, 209 transitions, 3180 flow. Second operand 36 states and 1343 transitions. [2025-03-04 10:18:36,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 634 transitions, 8478 flow [2025-03-04 10:18:36,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 634 transitions, 8303 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:36,532 INFO L231 Difference]: Finished difference. Result has 210 places, 242 transitions, 3570 flow [2025-03-04 10:18:36,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3096, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3570, PETRI_PLACES=210, PETRI_TRANSITIONS=242} [2025-03-04 10:18:36,533 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 149 predicate places. [2025-03-04 10:18:36,533 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 242 transitions, 3570 flow [2025-03-04 10:18:36,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 30.166666666666668) internal successors, (543), 18 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:18:36,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:36,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:36,539 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:18:36,733 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,SelfDestructingSolverStorable28 [2025-03-04 10:18:36,734 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:36,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1669563922, now seen corresponding path program 3 times [2025-03-04 10:18:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:36,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141922109] [2025-03-04 10:18:36,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:36,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:18:36,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-03-04 10:18:36,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:36,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:37,464 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:18:37,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:37,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141922109] [2025-03-04 10:18:37,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141922109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:37,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:37,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:37,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339244381] [2025-03-04 10:18:37,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:37,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:37,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:37,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:37,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-03-04 10:18:37,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 242 transitions, 3570 flow. Second operand has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 7 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:18:37,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:37,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-03-04 10:18:37,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:40,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 10:18:42,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 10:18:47,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 10:18:47,841 INFO L124 PetriNetUnfolderBase]: 2647/4587 cut-off events. [2025-03-04 10:18:47,841 INFO L125 PetriNetUnfolderBase]: For 47800/47800 co-relation queries the response was YES. [2025-03-04 10:18:47,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27294 conditions, 4587 events. 2647/4587 cut-off events. For 47800/47800 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 25701 event pairs, 1434 based on Foata normal form. 34/4621 useless extension candidates. Maximal degree in co-relation 27153. Up to 3676 conditions per place. [2025-03-04 10:18:47,873 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 232 selfloop transitions, 64 changer transitions 0/297 dead transitions. [2025-03-04 10:18:47,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 297 transitions, 4735 flow [2025-03-04 10:18:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 297 transitions. [2025-03-04 10:18:47,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580078125 [2025-03-04 10:18:47,874 INFO L175 Difference]: Start difference. First operand has 210 places, 242 transitions, 3570 flow. Second operand 8 states and 297 transitions. [2025-03-04 10:18:47,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 297 transitions, 4735 flow [2025-03-04 10:18:48,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 297 transitions, 4167 flow, removed 146 selfloop flow, removed 23 redundant places. [2025-03-04 10:18:48,037 INFO L231 Difference]: Finished difference. Result has 186 places, 248 transitions, 3302 flow [2025-03-04 10:18:48,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3071, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3302, PETRI_PLACES=186, PETRI_TRANSITIONS=248} [2025-03-04 10:18:48,038 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 125 predicate places. [2025-03-04 10:18:48,038 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 248 transitions, 3302 flow [2025-03-04 10:18:48,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 7 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:18:48,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:48,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:48,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 10:18:48,038 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-04 10:18:48,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash 108938372, now seen corresponding path program 4 times [2025-03-04 10:18:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:48,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813101655] [2025-03-04 10:18:48,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:48,042 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:18:48,046 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:48,046 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:48,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:48,172 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:18:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:48,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813101655] [2025-03-04 10:18:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813101655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:48,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298884040] [2025-03-04 10:18:48,172 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:48,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:48,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:48,174 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:18:48,176 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:18:48,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:18:48,235 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:18:48,235 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:48,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:48,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:18:48,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:48,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:18:48,481 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:18:48,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:48,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 106 [2025-03-04 10:18:49,124 INFO L349 Elim1Store]: treesize reduction 5, result has 97.7 percent of original size [2025-03-04 10:18:49,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 332 treesize of output 417 [2025-03-04 10:19:28,519 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:19:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298884040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:19:28,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:19:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 23 [2025-03-04 10:19:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080042812] [2025-03-04 10:19:28,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:19:28,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:19:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:28,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:19:28,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:19:33,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:19:37,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]