./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/pthread-complex/safestack_relacy.i -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 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:12:06,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:12:06,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:12:06,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:12:06,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:12:06,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:12:06,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:12:06,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:12:06,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:12:06,404 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:12:06,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:12:06,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:12:06,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:12:06,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:12:06,405 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:12:06,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:12:06,405 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:12:06,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:12:06,406 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:12:06,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:12:06,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:12:06,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:12:06,408 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 -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2025-03-09 01:12:06,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:12:06,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:12:06,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:12:06,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:12:06,631 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:12:06,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-03-09 01:12:07,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29d5562e/aabbece7cb60419c93ef252db0c31624/FLAG9821b49f3 [2025-03-09 01:12:08,091 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:12:08,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-03-09 01:12:08,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29d5562e/aabbece7cb60419c93ef252db0c31624/FLAG9821b49f3 [2025-03-09 01:12:08,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29d5562e/aabbece7cb60419c93ef252db0c31624 [2025-03-09 01:12:08,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:12:08,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:12:08,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:12:08,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:12:08,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:12:08,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e734c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08, skipping insertion in model container [2025-03-09 01:12:08,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:12:08,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:12:08,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:12:08,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:12:08,682 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:12:08,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08 WrapperNode [2025-03-09 01:12:08,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:12:08,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:12:08,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:12:08,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:12:08,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,721 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 162 [2025-03-09 01:12:08,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:12:08,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:12:08,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:12:08,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:12:08,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,745 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 5, 30]. 81 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 3, 8]. The 13 writes are split as follows [0, 1, 12]. [2025-03-09 01:12:08,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:12:08,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:12:08,767 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:12:08,767 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:12:08,768 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (1/1) ... [2025-03-09 01:12:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:12:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:12:08,796 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-09 01:12:08,801 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-09 01:12:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:12:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-09 01:12:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:12:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:12:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:12:08,818 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:12:09,048 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:12:09,050 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:12:09,388 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:12:09,389 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:12:09,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:12:09,523 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:12:09,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:12:09 BoogieIcfgContainer [2025-03-09 01:12:09,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:12:09,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:12:09,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:12:09,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:12:09,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:12:08" (1/3) ... [2025-03-09 01:12:09,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5588061d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:12:09, skipping insertion in model container [2025-03-09 01:12:09,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:12:08" (2/3) ... [2025-03-09 01:12:09,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5588061d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:12:09, skipping insertion in model container [2025-03-09 01:12:09,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:12:09" (3/3) ... [2025-03-09 01:12:09,531 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-03-09 01:12:09,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:12:09,542 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 104 locations, 1 initial locations, 7 loop locations, and 50 error locations. [2025-03-09 01:12:09,542 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:12:09,606 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:12:09,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 117 transitions, 241 flow [2025-03-09 01:12:09,683 INFO L124 PetriNetUnfolderBase]: 13/129 cut-off events. [2025-03-09 01:12:09,685 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:12:09,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 129 events. 13/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 477 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 95. Up to 3 conditions per place. [2025-03-09 01:12:09,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 117 transitions, 241 flow [2025-03-09 01:12:09,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 117 transitions, 241 flow [2025-03-09 01:12:09,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:12:09,713 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;@f927eaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:12:09,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2025-03-09 01:12:09,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:12:09,718 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-09 01:12:09,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:12:09,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:09,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:12:09,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash 17939, now seen corresponding path program 1 times [2025-03-09 01:12:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:09,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631766514] [2025-03-09 01:12:09,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:09,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:12:09,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:12:09,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:09,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:10,038 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-09 01:12:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631766514] [2025-03-09 01:12:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631766514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:10,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:10,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450209540] [2025-03-09 01:12:10,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:10,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:10,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:10,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:10,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:10,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-09 01:12:10,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:10,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:10,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-09 01:12:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:10,303 INFO L124 PetriNetUnfolderBase]: 223/549 cut-off events. [2025-03-09 01:12:10,303 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-09 01:12:10,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 549 events. 223/549 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2388 event pairs, 185 based on Foata normal form. 24/409 useless extension candidates. Maximal degree in co-relation 954. Up to 454 conditions per place. [2025-03-09 01:12:10,310 INFO L140 encePairwiseOnDemand]: 83/117 looper letters, 59 selfloop transitions, 1 changer transitions 0/83 dead transitions. [2025-03-09 01:12:10,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 83 transitions, 293 flow [2025-03-09 01:12:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-09 01:12:10,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2025-03-09 01:12:10,321 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 241 flow. Second operand 3 states and 165 transitions. [2025-03-09 01:12:10,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 83 transitions, 293 flow [2025-03-09 01:12:10,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 293 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:12:10,328 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 175 flow [2025-03-09 01:12:10,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2025-03-09 01:12:10,333 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -27 predicate places. [2025-03-09 01:12:10,334 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 175 flow [2025-03-09 01:12:10,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:10,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:10,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:12:10,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:12:10,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:10,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash 17940, now seen corresponding path program 1 times [2025-03-09 01:12:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022123603] [2025-03-09 01:12:10,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:10,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:12:10,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:12:10,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:10,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:10,500 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-09 01:12:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:10,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022123603] [2025-03-09 01:12:10,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022123603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:10,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:10,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348813028] [2025-03-09 01:12:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:10,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:10,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:10,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:10,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 117 [2025-03-09 01:12:10,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:10,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:10,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 117 [2025-03-09 01:12:10,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:10,627 INFO L124 PetriNetUnfolderBase]: 188/470 cut-off events. [2025-03-09 01:12:10,627 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-09 01:12:10,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 470 events. 188/470 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1976 event pairs, 150 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 846. Up to 375 conditions per place. [2025-03-09 01:12:10,630 INFO L140 encePairwiseOnDemand]: 107/117 looper letters, 50 selfloop transitions, 1 changer transitions 0/74 dead transitions. [2025-03-09 01:12:10,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 259 flow [2025-03-09 01:12:10,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-09 01:12:10,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39316239316239315 [2025-03-09 01:12:10,631 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 175 flow. Second operand 3 states and 138 transitions. [2025-03-09 01:12:10,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 259 flow [2025-03-09 01:12:10,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:12:10,632 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 158 flow [2025-03-09 01:12:10,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2025-03-09 01:12:10,633 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -35 predicate places. [2025-03-09 01:12:10,633 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 158 flow [2025-03-09 01:12:10,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:10,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:10,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:12:10,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:12:10,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:10,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash -597506969, now seen corresponding path program 1 times [2025-03-09 01:12:10,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:10,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707914824] [2025-03-09 01:12:10,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:10,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:10,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:12:10,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:12:10,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:10,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:10,767 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-09 01:12:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707914824] [2025-03-09 01:12:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707914824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:10,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:10,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:12:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850830637] [2025-03-09 01:12:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:10,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:10,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:10,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:10,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 117 [2025-03-09 01:12:10,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:10,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:10,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 117 [2025-03-09 01:12:10,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:10,933 INFO L124 PetriNetUnfolderBase]: 189/477 cut-off events. [2025-03-09 01:12:10,933 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-09 01:12:10,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 477 events. 189/477 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2009 event pairs, 150 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 859. Up to 377 conditions per place. [2025-03-09 01:12:10,938 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 53 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-03-09 01:12:10,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 282 flow [2025-03-09 01:12:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:12:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:12:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-03-09 01:12:10,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33760683760683763 [2025-03-09 01:12:10,941 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 158 flow. Second operand 4 states and 158 transitions. [2025-03-09 01:12:10,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 282 flow [2025-03-09 01:12:10,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:12:10,943 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 178 flow [2025-03-09 01:12:10,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2025-03-09 01:12:10,944 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -32 predicate places. [2025-03-09 01:12:10,944 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 178 flow [2025-03-09 01:12:10,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:10,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:10,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:12:10,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:12:10,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash -597506881, now seen corresponding path program 1 times [2025-03-09 01:12:10,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:10,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432216227] [2025-03-09 01:12:10,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:10,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:12:10,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:12:10,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:10,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:11,023 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-09 01:12:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432216227] [2025-03-09 01:12:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432216227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:12:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189607526] [2025-03-09 01:12:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:11,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:11,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:11,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-09 01:12:11,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:11,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:11,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-09 01:12:11,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:11,196 INFO L124 PetriNetUnfolderBase]: 188/473 cut-off events. [2025-03-09 01:12:11,197 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-09 01:12:11,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 473 events. 188/473 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1971 event pairs, 150 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 859. Up to 368 conditions per place. [2025-03-09 01:12:11,199 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 51 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-09 01:12:11,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 285 flow [2025-03-09 01:12:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:12:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:12:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-03-09 01:12:11,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3247863247863248 [2025-03-09 01:12:11,200 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 178 flow. Second operand 4 states and 152 transitions. [2025-03-09 01:12:11,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 285 flow [2025-03-09 01:12:11,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 279 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:12:11,202 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 179 flow [2025-03-09 01:12:11,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2025-03-09 01:12:11,203 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -30 predicate places. [2025-03-09 01:12:11,203 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 179 flow [2025-03-09 01:12:11,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:11,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:11,203 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:11,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:12:11,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:11,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1985152894, now seen corresponding path program 1 times [2025-03-09 01:12:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:11,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223367167] [2025-03-09 01:12:11,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:11,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:12:11,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:12:11,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:11,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:11,419 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-09 01:12:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:11,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223367167] [2025-03-09 01:12:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223367167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:12:11,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077743867] [2025-03-09 01:12:11,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:11,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:12:11,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:12:11,422 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-09 01:12:11,424 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-09 01:12:11,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:12:11,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:12:11,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:11,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:11,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:12:11,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:12:11,599 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-09 01:12:11,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:12:11,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-09 01:12:11,703 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-09 01:12:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077743867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:12:11,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:12:11,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-09 01:12:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578916327] [2025-03-09 01:12:11,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:12:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:12:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:11,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:12:11,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:12:11,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 117 [2025-03-09 01:12:11,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 179 flow. Second operand has 14 states, 14 states have (on average 24.928571428571427) internal successors, (349), 14 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:11,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:11,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 117 [2025-03-09 01:12:11,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:12,149 INFO L124 PetriNetUnfolderBase]: 189/477 cut-off events. [2025-03-09 01:12:12,149 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-03-09 01:12:12,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 477 events. 189/477 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1989 event pairs, 150 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 873. Up to 368 conditions per place. [2025-03-09 01:12:12,153 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 54 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-03-09 01:12:12,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 315 flow [2025-03-09 01:12:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:12:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:12:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2025-03-09 01:12:12,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27228327228327226 [2025-03-09 01:12:12,156 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 179 flow. Second operand 7 states and 223 transitions. [2025-03-09 01:12:12,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 315 flow [2025-03-09 01:12:12,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 305 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:12:12,159 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 190 flow [2025-03-09 01:12:12,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2025-03-09 01:12:12,160 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -27 predicate places. [2025-03-09 01:12:12,160 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 190 flow [2025-03-09 01:12:12,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.928571428571427) internal successors, (349), 14 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:12,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:12,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:12,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:12:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:12:12,365 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1985152806, now seen corresponding path program 1 times [2025-03-09 01:12:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631450994] [2025-03-09 01:12:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:12:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:12:12,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:12,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:12,470 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-09 01:12:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631450994] [2025-03-09 01:12:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631450994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:12:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574395659] [2025-03-09 01:12:12,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:12,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:12:12,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:12:12,472 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-09 01:12:12,474 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-09 01:12:12,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:12:12,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:12:12,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:12,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:12,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:12:12,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:12:12,588 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-09 01:12:12,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:12:12,613 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-09 01:12:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574395659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:12:12,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:12:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:12:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426741711] [2025-03-09 01:12:12,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:12:12,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:12:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:12,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:12:12,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:12:12,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 117 [2025-03-09 01:12:12,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 190 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 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-09 01:12:12,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:12,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 117 [2025-03-09 01:12:12,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:12,821 INFO L124 PetriNetUnfolderBase]: 188/475 cut-off events. [2025-03-09 01:12:12,821 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2025-03-09 01:12:12,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 475 events. 188/475 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1972 event pairs, 150 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 875. Up to 368 conditions per place. [2025-03-09 01:12:12,824 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 52 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2025-03-09 01:12:12,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 319 flow [2025-03-09 01:12:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:12:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:12:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2025-03-09 01:12:12,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2025-03-09 01:12:12,826 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 190 flow. Second operand 6 states and 198 transitions. [2025-03-09 01:12:12,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 319 flow [2025-03-09 01:12:12,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 308 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:12:12,828 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 200 flow [2025-03-09 01:12:12,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-03-09 01:12:12,828 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -25 predicate places. [2025-03-09 01:12:12,828 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 200 flow [2025-03-09 01:12:12,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 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-09 01:12:12,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:12,829 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:12,835 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-09 01:12:13,029 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-09 01:12:13,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:13,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2010286815, now seen corresponding path program 2 times [2025-03-09 01:12:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049639924] [2025-03-09 01:12:13,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:12:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:13,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:12:13,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:12:13,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:12:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:13,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:13,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049639924] [2025-03-09 01:12:13,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049639924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:13,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:13,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:13,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479014125] [2025-03-09 01:12:13,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:13,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:13,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:13,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:13,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:13,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 117 [2025-03-09 01:12:13,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:13,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 117 [2025-03-09 01:12:13,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:13,218 INFO L124 PetriNetUnfolderBase]: 188/474 cut-off events. [2025-03-09 01:12:13,218 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2025-03-09 01:12:13,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 474 events. 188/474 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1967 event pairs, 150 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 872. Up to 368 conditions per place. [2025-03-09 01:12:13,220 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 49 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-09 01:12:13,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 300 flow [2025-03-09 01:12:13,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-09 01:12:13,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3646723646723647 [2025-03-09 01:12:13,222 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 200 flow. Second operand 3 states and 128 transitions. [2025-03-09 01:12:13,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 300 flow [2025-03-09 01:12:13,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:12:13,223 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 188 flow [2025-03-09 01:12:13,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-09 01:12:13,224 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -28 predicate places. [2025-03-09 01:12:13,224 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 188 flow [2025-03-09 01:12:13,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:13,224 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:12:13,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -568941446, now seen corresponding path program 1 times [2025-03-09 01:12:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17156834] [2025-03-09 01:12:13,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:13,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:12:13,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:12:13,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:13,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:13,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17156834] [2025-03-09 01:12:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17156834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:13,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:13,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016817921] [2025-03-09 01:12:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:13,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:13,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:13,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:13,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-09 01:12:13,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:13,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-09 01:12:13,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:13,412 INFO L124 PetriNetUnfolderBase]: 188/468 cut-off events. [2025-03-09 01:12:13,412 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-03-09 01:12:13,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 468 events. 188/468 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1921 event pairs, 150 based on Foata normal form. 64/428 useless extension candidates. Maximal degree in co-relation 861. Up to 377 conditions per place. [2025-03-09 01:12:13,414 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 50 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2025-03-09 01:12:13,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 73 transitions, 286 flow [2025-03-09 01:12:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-09 01:12:13,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3504273504273504 [2025-03-09 01:12:13,415 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 188 flow. Second operand 3 states and 123 transitions. [2025-03-09 01:12:13,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 73 transitions, 286 flow [2025-03-09 01:12:13,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:12:13,417 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 182 flow [2025-03-09 01:12:13,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-03-09 01:12:13,417 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -30 predicate places. [2025-03-09 01:12:13,417 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 182 flow [2025-03-09 01:12:13,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:13,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:13,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:12:13,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:13,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash -568941445, now seen corresponding path program 1 times [2025-03-09 01:12:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:13,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964735732] [2025-03-09 01:12:13,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:13,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:13,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:12:13,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:12:13,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:13,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:13,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964735732] [2025-03-09 01:12:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964735732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:13,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:13,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:12:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193970217] [2025-03-09 01:12:13,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:13,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:13,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:13,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:13,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-09 01:12:13,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:13,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-09 01:12:13,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:13,669 INFO L124 PetriNetUnfolderBase]: 153/419 cut-off events. [2025-03-09 01:12:13,669 INFO L125 PetriNetUnfolderBase]: For 10/13 co-relation queries the response was YES. [2025-03-09 01:12:13,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 419 events. 153/419 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1952 event pairs, 45 based on Foata normal form. 61/395 useless extension candidates. Maximal degree in co-relation 755. Up to 216 conditions per place. [2025-03-09 01:12:13,671 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 82 selfloop transitions, 5 changer transitions 1/108 dead transitions. [2025-03-09 01:12:13,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 428 flow [2025-03-09 01:12:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:12:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:12:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-03-09 01:12:13,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-03-09 01:12:13,673 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 182 flow. Second operand 4 states and 186 transitions. [2025-03-09 01:12:13,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 428 flow [2025-03-09 01:12:13,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:12:13,675 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 199 flow [2025-03-09 01:12:13,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-03-09 01:12:13,678 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -27 predicate places. [2025-03-09 01:12:13,678 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 199 flow [2025-03-09 01:12:13,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:13,679 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:13,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:12:13,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:13,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash -235743199, now seen corresponding path program 1 times [2025-03-09 01:12:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693860249] [2025-03-09 01:12:13,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:13,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:12:13,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:12:13,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:13,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693860249] [2025-03-09 01:12:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693860249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:12:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059511376] [2025-03-09 01:12:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:13,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:12:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:13,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:12:13,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:12:13,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 117 [2025-03-09 01:12:13,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:13,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 117 [2025-03-09 01:12:13,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:13,974 INFO L124 PetriNetUnfolderBase]: 77/262 cut-off events. [2025-03-09 01:12:13,974 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-09 01:12:13,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 262 events. 77/262 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1085 event pairs, 2 based on Foata normal form. 66/300 useless extension candidates. Maximal degree in co-relation 520. Up to 134 conditions per place. [2025-03-09 01:12:13,976 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 78 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2025-03-09 01:12:13,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 398 flow [2025-03-09 01:12:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:12:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:12:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2025-03-09 01:12:13,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2025-03-09 01:12:13,978 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 199 flow. Second operand 5 states and 201 transitions. [2025-03-09 01:12:13,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 398 flow [2025-03-09 01:12:13,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 390 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:12:13,981 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 164 flow [2025-03-09 01:12:13,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-09 01:12:13,982 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -36 predicate places. [2025-03-09 01:12:13,982 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 164 flow [2025-03-09 01:12:13,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:13,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:13,982 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:13,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:12:13,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-09 01:12:13,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1281895988, now seen corresponding path program 1 times [2025-03-09 01:12:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655992650] [2025-03-09 01:12:13,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:13,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:12:14,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:12:14,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:14,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:12:14,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:12:14,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:12:14,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:12:14,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:14,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:12:14,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:12:14,033 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:12:14,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 88 remaining) [2025-03-09 01:12:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2025-03-09 01:12:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2025-03-09 01:12:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2025-03-09 01:12:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2025-03-09 01:12:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2025-03-09 01:12:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2025-03-09 01:12:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (74 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2025-03-09 01:12:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (65 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2025-03-09 01:12:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (28 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2025-03-09 01:12:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2025-03-09 01:12:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2025-03-09 01:12:14,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:12:14,040 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:14,042 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:12:14,042 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:12:14,092 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:12:14,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 201 transitions, 418 flow [2025-03-09 01:12:14,110 INFO L124 PetriNetUnfolderBase]: 26/237 cut-off events. [2025-03-09 01:12:14,110 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:12:14,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 237 events. 26/237 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1209 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 187. Up to 6 conditions per place. [2025-03-09 01:12:14,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 201 transitions, 418 flow [2025-03-09 01:12:14,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 201 transitions, 418 flow [2025-03-09 01:12:14,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:12:14,115 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;@f927eaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:12:14,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-03-09 01:12:14,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:12:14,115 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-09 01:12:14,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:12:14,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:14,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:12:14,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:14,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:14,116 INFO L85 PathProgramCache]: Analyzing trace with hash 24371, now seen corresponding path program 1 times [2025-03-09 01:12:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:14,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627743279] [2025-03-09 01:12:14,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:14,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:12:14,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:12:14,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:14,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:14,167 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-09 01:12:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627743279] [2025-03-09 01:12:14,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627743279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:14,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:14,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337900644] [2025-03-09 01:12:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:14,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:14,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 201 [2025-03-09 01:12:14,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 201 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:14,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:14,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 201 [2025-03-09 01:12:14,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:15,962 INFO L124 PetriNetUnfolderBase]: 19095/30081 cut-off events. [2025-03-09 01:12:15,963 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-03-09 01:12:16,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58596 conditions, 30081 events. 19095/30081 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 204901 event pairs, 16870 based on Foata normal form. 1814/22591 useless extension candidates. Maximal degree in co-relation 57121. Up to 28316 conditions per place. [2025-03-09 01:12:16,162 INFO L140 encePairwiseOnDemand]: 138/201 looper letters, 102 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2025-03-09 01:12:16,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 496 flow [2025-03-09 01:12:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2025-03-09 01:12:16,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4527363184079602 [2025-03-09 01:12:16,164 INFO L175 Difference]: Start difference. First operand has 181 places, 201 transitions, 418 flow. Second operand 3 states and 273 transitions. [2025-03-09 01:12:16,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 496 flow [2025-03-09 01:12:16,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 137 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:12:16,166 INFO L231 Difference]: Finished difference. Result has 129 places, 137 transitions, 292 flow [2025-03-09 01:12:16,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=129, PETRI_TRANSITIONS=137} [2025-03-09 01:12:16,167 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -52 predicate places. [2025-03-09 01:12:16,167 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 137 transitions, 292 flow [2025-03-09 01:12:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:16,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:16,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:12:16,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:12:16,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:16,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 24372, now seen corresponding path program 1 times [2025-03-09 01:12:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145028102] [2025-03-09 01:12:16,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:16,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:12:16,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:12:16,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:16,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:16,225 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-09 01:12:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:16,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145028102] [2025-03-09 01:12:16,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145028102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:16,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:16,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:16,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126459424] [2025-03-09 01:12:16,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:16,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:16,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:16,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:16,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 201 [2025-03-09 01:12:16,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 137 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:16,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:16,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 201 [2025-03-09 01:12:16,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:17,307 INFO L124 PetriNetUnfolderBase]: 13222/20974 cut-off events. [2025-03-09 01:12:17,307 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-09 01:12:17,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40534 conditions, 20974 events. 13222/20974 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 136968 event pairs, 11340 based on Foata normal form. 0/16295 useless extension candidates. Maximal degree in co-relation 40526. Up to 19394 conditions per place. [2025-03-09 01:12:17,401 INFO L140 encePairwiseOnDemand]: 184/201 looper letters, 86 selfloop transitions, 1 changer transitions 0/121 dead transitions. [2025-03-09 01:12:17,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 121 transitions, 434 flow [2025-03-09 01:12:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2025-03-09 01:12:17,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36981757877280264 [2025-03-09 01:12:17,403 INFO L175 Difference]: Start difference. First operand has 129 places, 137 transitions, 292 flow. Second operand 3 states and 223 transitions. [2025-03-09 01:12:17,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 121 transitions, 434 flow [2025-03-09 01:12:17,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 121 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:12:17,407 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 261 flow [2025-03-09 01:12:17,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2025-03-09 01:12:17,408 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -67 predicate places. [2025-03-09 01:12:17,408 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 261 flow [2025-03-09 01:12:17,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:17,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:17,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:12:17,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:12:17,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:17,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1053800391, now seen corresponding path program 1 times [2025-03-09 01:12:17,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:17,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540096208] [2025-03-09 01:12:17,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:17,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:17,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:12:17,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:12:17,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:17,477 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-09 01:12:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:17,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540096208] [2025-03-09 01:12:17,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540096208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:17,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:17,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:12:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035549741] [2025-03-09 01:12:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:17,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:17,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:17,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:17,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 201 [2025-03-09 01:12:17,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 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-09 01:12:17,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:17,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 201 [2025-03-09 01:12:17,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:18,602 INFO L124 PetriNetUnfolderBase]: 13223/20981 cut-off events. [2025-03-09 01:12:18,603 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-09 01:12:18,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40548 conditions, 20981 events. 13223/20981 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 136952 event pairs, 11340 based on Foata normal form. 0/16300 useless extension candidates. Maximal degree in co-relation 40539. Up to 19396 conditions per place. [2025-03-09 01:12:18,706 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 89 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2025-03-09 01:12:18,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 126 transitions, 457 flow [2025-03-09 01:12:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:12:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:12:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-03-09 01:12:18,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31094527363184077 [2025-03-09 01:12:18,708 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 261 flow. Second operand 4 states and 250 transitions. [2025-03-09 01:12:18,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 126 transitions, 457 flow [2025-03-09 01:12:18,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 126 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:12:18,710 INFO L231 Difference]: Finished difference. Result has 117 places, 123 transitions, 281 flow [2025-03-09 01:12:18,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=117, PETRI_TRANSITIONS=123} [2025-03-09 01:12:18,712 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -64 predicate places. [2025-03-09 01:12:18,712 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 123 transitions, 281 flow [2025-03-09 01:12:18,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 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-09 01:12:18,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:18,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:12:18,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:12:18,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:18,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1053800479, now seen corresponding path program 1 times [2025-03-09 01:12:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484472127] [2025-03-09 01:12:18,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:18,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:18,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:12:18,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:12:18,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:18,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:18,766 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-09 01:12:18,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:18,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484472127] [2025-03-09 01:12:18,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484472127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:18,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:12:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14074867] [2025-03-09 01:12:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:18,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:18,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:18,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:18,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:18,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-09 01:12:18,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 123 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:18,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:18,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-09 01:12:18,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:20,142 INFO L124 PetriNetUnfolderBase]: 13222/20977 cut-off events. [2025-03-09 01:12:20,143 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2025-03-09 01:12:20,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40550 conditions, 20977 events. 13222/20977 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 136963 event pairs, 11340 based on Foata normal form. 1/16301 useless extension candidates. Maximal degree in co-relation 40539. Up to 19387 conditions per place. [2025-03-09 01:12:20,222 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 87 selfloop transitions, 4 changer transitions 0/123 dead transitions. [2025-03-09 01:12:20,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 123 transitions, 460 flow [2025-03-09 01:12:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:12:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:12:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-03-09 01:12:20,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3034825870646766 [2025-03-09 01:12:20,223 INFO L175 Difference]: Start difference. First operand has 117 places, 123 transitions, 281 flow. Second operand 4 states and 244 transitions. [2025-03-09 01:12:20,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 123 transitions, 460 flow [2025-03-09 01:12:20,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 454 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:12:20,225 INFO L231 Difference]: Finished difference. Result has 119 places, 122 transitions, 282 flow [2025-03-09 01:12:20,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=119, PETRI_TRANSITIONS=122} [2025-03-09 01:12:20,226 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -62 predicate places. [2025-03-09 01:12:20,226 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 122 transitions, 282 flow [2025-03-09 01:12:20,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:20,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:20,226 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:12:20,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1852167371, now seen corresponding path program 1 times [2025-03-09 01:12:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:20,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117085829] [2025-03-09 01:12:20,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:20,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:12:20,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:12:20,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:20,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:20,349 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-09 01:12:20,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:20,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117085829] [2025-03-09 01:12:20,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117085829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:12:20,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448160652] [2025-03-09 01:12:20,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:20,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:12:20,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:12:20,352 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-09 01:12:20,353 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-09 01:12:20,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:12:20,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:12:20,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:20,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:20,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:12:20,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:12:20,482 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-09 01:12:20,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:12:20,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-09 01:12:20,553 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-09 01:12:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448160652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:12:20,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:12:20,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-09 01:12:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478768371] [2025-03-09 01:12:20,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:12:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:12:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:20,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:12:20,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:12:20,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 201 [2025-03-09 01:12:20,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 122 transitions, 282 flow. Second operand has 14 states, 14 states have (on average 38.92857142857143) internal successors, (545), 14 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:20,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:20,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 201 [2025-03-09 01:12:20,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:21,996 INFO L124 PetriNetUnfolderBase]: 13223/20981 cut-off events. [2025-03-09 01:12:21,996 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-03-09 01:12:22,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40565 conditions, 20981 events. 13223/20981 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 136959 event pairs, 11340 based on Foata normal form. 1/16304 useless extension candidates. Maximal degree in co-relation 40553. Up to 19387 conditions per place. [2025-03-09 01:12:22,123 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 90 selfloop transitions, 7 changer transitions 0/128 dead transitions. [2025-03-09 01:12:22,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 128 transitions, 490 flow [2025-03-09 01:12:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:12:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:12:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 357 transitions. [2025-03-09 01:12:22,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2537313432835821 [2025-03-09 01:12:22,125 INFO L175 Difference]: Start difference. First operand has 119 places, 122 transitions, 282 flow. Second operand 7 states and 357 transitions. [2025-03-09 01:12:22,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 128 transitions, 490 flow [2025-03-09 01:12:22,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 128 transitions, 480 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:12:22,127 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 293 flow [2025-03-09 01:12:22,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-03-09 01:12:22,127 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -59 predicate places. [2025-03-09 01:12:22,127 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 293 flow [2025-03-09 01:12:22,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.92857142857143) internal successors, (545), 14 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:22,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:22,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:22,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:12:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:12:22,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1852167459, now seen corresponding path program 1 times [2025-03-09 01:12:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049932727] [2025-03-09 01:12:22,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:22,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:12:22,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:12:22,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:22,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:22,387 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-09 01:12:22,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:22,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049932727] [2025-03-09 01:12:22,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049932727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:12:22,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771920733] [2025-03-09 01:12:22,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:22,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:12:22,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:12:22,391 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-09 01:12:22,393 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-09 01:12:22,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:12:22,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:12:22,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:22,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:22,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:12:22,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:12:22,496 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-09 01:12:22,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:12:22,517 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-09 01:12:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771920733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:12:22,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:12:22,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:12:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217769411] [2025-03-09 01:12:22,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:12:22,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:12:22,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:22,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:12:22,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:12:22,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 201 [2025-03-09 01:12:22,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 293 flow. Second operand has 8 states, 8 states have (on average 39.25) internal successors, (314), 8 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:22,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:22,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 201 [2025-03-09 01:12:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:23,414 INFO L124 PetriNetUnfolderBase]: 13222/20979 cut-off events. [2025-03-09 01:12:23,414 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-09 01:12:23,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40568 conditions, 20979 events. 13222/20979 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 136929 event pairs, 11340 based on Foata normal form. 1/16303 useless extension candidates. Maximal degree in co-relation 40555. Up to 19387 conditions per place. [2025-03-09 01:12:23,521 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 88 selfloop transitions, 7 changer transitions 0/126 dead transitions. [2025-03-09 01:12:23,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 126 transitions, 494 flow [2025-03-09 01:12:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:12:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:12:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 318 transitions. [2025-03-09 01:12:23,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.263681592039801 [2025-03-09 01:12:23,523 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 293 flow. Second operand 6 states and 318 transitions. [2025-03-09 01:12:23,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 126 transitions, 494 flow [2025-03-09 01:12:23,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 483 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:12:23,525 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 303 flow [2025-03-09 01:12:23,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2025-03-09 01:12:23,525 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -57 predicate places. [2025-03-09 01:12:23,525 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 123 transitions, 303 flow [2025-03-09 01:12:23,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.25) internal successors, (314), 8 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:23,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:23,526 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:23,531 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-09 01:12:23,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:12:23,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash 473983391, now seen corresponding path program 2 times [2025-03-09 01:12:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:23,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842668196] [2025-03-09 01:12:23,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:12:23,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:23,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:12:23,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:12:23,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:12:23,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:23,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842668196] [2025-03-09 01:12:23,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842668196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:23,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:23,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:23,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486043153] [2025-03-09 01:12:23,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:23,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:23,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:23,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:23,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 201 [2025-03-09 01:12:23,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:23,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:23,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 201 [2025-03-09 01:12:23,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:25,022 INFO L124 PetriNetUnfolderBase]: 13222/20978 cut-off events. [2025-03-09 01:12:25,022 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-03-09 01:12:25,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40565 conditions, 20978 events. 13222/20978 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 136949 event pairs, 11340 based on Foata normal form. 0/16302 useless extension candidates. Maximal degree in co-relation 40552. Up to 19387 conditions per place. [2025-03-09 01:12:25,137 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 85 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-03-09 01:12:25,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 122 transitions, 475 flow [2025-03-09 01:12:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-03-09 01:12:25,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3416252072968491 [2025-03-09 01:12:25,139 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 303 flow. Second operand 3 states and 206 transitions. [2025-03-09 01:12:25,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 122 transitions, 475 flow [2025-03-09 01:12:25,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 461 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:12:25,141 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 291 flow [2025-03-09 01:12:25,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2025-03-09 01:12:25,141 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -60 predicate places. [2025-03-09 01:12:25,141 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 291 flow [2025-03-09 01:12:25,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:25,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:25,141 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:12:25,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1412540061, now seen corresponding path program 1 times [2025-03-09 01:12:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232668433] [2025-03-09 01:12:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:25,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:12:25,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:12:25,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:25,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232668433] [2025-03-09 01:12:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232668433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826105109] [2025-03-09 01:12:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:25,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:25,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:25,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:25,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-09 01:12:25,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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-09 01:12:25,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:25,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-09 01:12:25,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:26,473 INFO L124 PetriNetUnfolderBase]: 13222/20966 cut-off events. [2025-03-09 01:12:26,474 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-03-09 01:12:26,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40548 conditions, 20966 events. 13222/20966 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 136850 event pairs, 11340 based on Foata normal form. 2175/18477 useless extension candidates. Maximal degree in co-relation 40535. Up to 19396 conditions per place. [2025-03-09 01:12:26,596 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 86 selfloop transitions, 1 changer transitions 0/120 dead transitions. [2025-03-09 01:12:26,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 461 flow [2025-03-09 01:12:26,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:12:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:12:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-03-09 01:12:26,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-03-09 01:12:26,598 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 291 flow. Second operand 3 states and 201 transitions. [2025-03-09 01:12:26,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 461 flow [2025-03-09 01:12:26,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 120 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:12:26,600 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 285 flow [2025-03-09 01:12:26,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-03-09 01:12:26,601 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -62 predicate places. [2025-03-09 01:12:26,601 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 285 flow [2025-03-09 01:12:26,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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-09 01:12:26,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:26,601 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:26,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:12:26,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:26,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1412540060, now seen corresponding path program 1 times [2025-03-09 01:12:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698609139] [2025-03-09 01:12:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:26,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:12:26,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:12:26,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:26,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:26,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:26,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698609139] [2025-03-09 01:12:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698609139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:26,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:12:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679382456] [2025-03-09 01:12:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:26,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:12:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:26,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:12:26,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:12:26,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-09 01:12:26,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 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-09 01:12:26,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:26,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-09 01:12:26,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:27,734 INFO L124 PetriNetUnfolderBase]: 11052/18212 cut-off events. [2025-03-09 01:12:27,734 INFO L125 PetriNetUnfolderBase]: For 422/522 co-relation queries the response was YES. [2025-03-09 01:12:27,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34761 conditions, 18212 events. 11052/18212 cut-off events. For 422/522 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 126015 event pairs, 5552 based on Foata normal form. 2085/16119 useless extension candidates. Maximal degree in co-relation 34748. Up to 12864 conditions per place. [2025-03-09 01:12:27,839 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 157 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-03-09 01:12:27,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 193 transitions, 761 flow [2025-03-09 01:12:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:12:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:12:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-03-09 01:12:27,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39303482587064675 [2025-03-09 01:12:27,841 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 285 flow. Second operand 4 states and 316 transitions. [2025-03-09 01:12:27,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 193 transitions, 761 flow [2025-03-09 01:12:27,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 193 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:12:27,844 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 312 flow [2025-03-09 01:12:27,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2025-03-09 01:12:27,844 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -59 predicate places. [2025-03-09 01:12:27,844 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 312 flow [2025-03-09 01:12:27,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 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-09 01:12:27,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:27,844 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:12:27,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:27,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash 34054456, now seen corresponding path program 1 times [2025-03-09 01:12:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472672898] [2025-03-09 01:12:27,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:27,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:27,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:12:27,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:12:27,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:27,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:27,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:27,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472672898] [2025-03-09 01:12:27,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472672898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:27,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:27,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:12:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201656593] [2025-03-09 01:12:27,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:27,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:12:27,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:27,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:12:27,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:12:28,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-09 01:12:28,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 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-09 01:12:28,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:28,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-09 01:12:28,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:28,981 INFO L124 PetriNetUnfolderBase]: 10918/19267 cut-off events. [2025-03-09 01:12:28,981 INFO L125 PetriNetUnfolderBase]: For 3927/4029 co-relation queries the response was YES. [2025-03-09 01:12:29,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38988 conditions, 19267 events. 10918/19267 cut-off events. For 3927/4029 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 151539 event pairs, 1953 based on Foata normal form. 193/16292 useless extension candidates. Maximal degree in co-relation 38973. Up to 10149 conditions per place. [2025-03-09 01:12:29,097 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 223 selfloop transitions, 7 changer transitions 1/262 dead transitions. [2025-03-09 01:12:29,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 262 transitions, 1060 flow [2025-03-09 01:12:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:12:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:12:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2025-03-09 01:12:29,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4208955223880597 [2025-03-09 01:12:29,100 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 312 flow. Second operand 5 states and 423 transitions. [2025-03-09 01:12:29,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 262 transitions, 1060 flow [2025-03-09 01:12:29,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 262 transitions, 1059 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:12:29,106 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 333 flow [2025-03-09 01:12:29,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-03-09 01:12:29,106 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -55 predicate places. [2025-03-09 01:12:29,107 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 333 flow [2025-03-09 01:12:29,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 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-09 01:12:29,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:29,107 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:29,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:12:29,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:29,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2014227605, now seen corresponding path program 1 times [2025-03-09 01:12:29,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:29,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967754692] [2025-03-09 01:12:29,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:29,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:12:29,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:12:29,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:29,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:12:29,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967754692] [2025-03-09 01:12:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967754692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:12:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475197857] [2025-03-09 01:12:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:29,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:12:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:29,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:12:29,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:12:29,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 201 [2025-03-09 01:12:29,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:29,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:29,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 201 [2025-03-09 01:12:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:12:30,008 INFO L124 PetriNetUnfolderBase]: 5996/11688 cut-off events. [2025-03-09 01:12:30,008 INFO L125 PetriNetUnfolderBase]: For 5923/5923 co-relation queries the response was YES. [2025-03-09 01:12:30,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24155 conditions, 11688 events. 5996/11688 cut-off events. For 5923/5923 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 94572 event pairs, 126 based on Foata normal form. 2178/12140 useless extension candidates. Maximal degree in co-relation 24138. Up to 6736 conditions per place. [2025-03-09 01:12:30,086 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 182 selfloop transitions, 4 changer transitions 0/214 dead transitions. [2025-03-09 01:12:30,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 214 transitions, 857 flow [2025-03-09 01:12:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:12:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:12:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2025-03-09 01:12:30,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34328358208955223 [2025-03-09 01:12:30,088 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 333 flow. Second operand 6 states and 414 transitions. [2025-03-09 01:12:30,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 214 transitions, 857 flow [2025-03-09 01:12:30,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 214 transitions, 842 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-09 01:12:30,093 INFO L231 Difference]: Finished difference. Result has 116 places, 110 transitions, 270 flow [2025-03-09 01:12:30,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2025-03-09 01:12:30,093 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -65 predicate places. [2025-03-09 01:12:30,093 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 270 flow [2025-03-09 01:12:30,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:30,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:30,093 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:30,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:12:30,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-09 01:12:30,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1983454533, now seen corresponding path program 1 times [2025-03-09 01:12:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:30,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150978499] [2025-03-09 01:12:30,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:30,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:12:30,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:12:30,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:12:30,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:12:30,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:12:30,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:12:30,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:30,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:12:30,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:12:30,130 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:12:30,130 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (124 of 125 remaining) [2025-03-09 01:12:30,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 125 remaining) [2025-03-09 01:12:30,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (111 of 125 remaining) [2025-03-09 01:12:30,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (102 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 125 remaining) [2025-03-09 01:12:30,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (65 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 125 remaining) [2025-03-09 01:12:30,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 125 remaining) [2025-03-09 01:12:30,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 125 remaining) [2025-03-09 01:12:30,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 125 remaining) [2025-03-09 01:12:30,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 125 remaining) [2025-03-09 01:12:30,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr12ASSERT_VIOLATIONMEMORY_LEAK (28 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 125 remaining) [2025-03-09 01:12:30,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 125 remaining) [2025-03-09 01:12:30,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 125 remaining) [2025-03-09 01:12:30,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:12:30,139 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:12:30,140 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:12:30,140 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 01:12:30,203 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:12:30,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 285 transitions, 597 flow [2025-03-09 01:12:30,226 INFO L124 PetriNetUnfolderBase]: 42/366 cut-off events. [2025-03-09 01:12:30,226 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 01:12:30,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 366 events. 42/366 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2139 event pairs, 1 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 291. Up to 12 conditions per place. [2025-03-09 01:12:30,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 285 transitions, 597 flow [2025-03-09 01:12:30,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 285 transitions, 597 flow [2025-03-09 01:12:30,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:12:30,238 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;@f927eaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:12:30,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2025-03-09 01:12:30,238 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:12:30,238 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-09 01:12:30,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:12:30,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:12:30,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:12:30,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2025-03-09 01:12:30,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:12:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash 33491, now seen corresponding path program 1 times [2025-03-09 01:12:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:12:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960140098] [2025-03-09 01:12:30,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:12:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:12:30,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:12:30,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:12:30,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:12:30,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:12:30,266 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-09 01:12:30,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:12:30,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960140098] [2025-03-09 01:12:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960140098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:12:30,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:12:30,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:12:30,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520101665] [2025-03-09 01:12:30,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:12:30,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:12:30,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:12:30,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:12:30,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:12:30,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 285 [2025-03-09 01:12:30,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 285 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:12:30,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:12:30,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 285 [2025-03-09 01:12:30,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand